./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.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_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/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_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/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_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/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 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:48:39,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:48:39,343 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:48:39,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:48:39,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:48:39,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:48:39,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:48:39,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:48:39,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:48:39,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:48:39,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:48:39,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:48:39,417 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:48:39,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:48:39,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:48:39,419 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:48:39,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:48:39,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:48:39,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:48:39,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:48:39,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:48:39,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:48:39,422 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:48:39,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:48:39,423 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:48:39,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:48:39,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:48:39,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:48:39,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:48:39,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:48:39,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:48:39,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:48:39,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:48:39,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:48:39,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:48:39,427 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:48:39,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:48:39,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:48:39,428 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:48:39,428 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_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/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_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/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 -> 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c [2023-11-19 07:48:39,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:48:39,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:48:39,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:48:39,801 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:48:39,802 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:48:39,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2023-11-19 07:48:42,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:48:43,239 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:48:43,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2023-11-19 07:48:43,249 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/data/cec7328b2/070d42b462ae4f6baf3e50cb6a6d85f7/FLAG2b9e40462 [2023-11-19 07:48:43,266 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/data/cec7328b2/070d42b462ae4f6baf3e50cb6a6d85f7 [2023-11-19 07:48:43,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:48:43,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:48:43,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:48:43,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:48:43,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:48:43,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513813af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43, skipping insertion in model container [2023-11-19 07:48:43,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,337 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:48:43,551 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_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2023-11-19 07:48:43,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:48:43,634 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:48:43,646 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_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2023-11-19 07:48:43,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:48:43,730 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:48:43,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43 WrapperNode [2023-11-19 07:48:43,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:48:43,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:48:43,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:48:43,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:48:43,740 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:48:43" (1/1) ... [2023-11-19 07:48:43,757 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:48:43" (1/1) ... [2023-11-19 07:48:43,808 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2023-11-19 07:48:43,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:48:43,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:48:43,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:48:43,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:48:43,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:48:43,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:48:43,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:48:43,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:48:43,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (1/1) ... [2023-11-19 07:48:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:48:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:43,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/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:48:43,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/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:48:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:48:43,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:48:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:48:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:48:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:48:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:48:43,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:48:43,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:48:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:48:43,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:48:43,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:48:44,075 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:48:44,078 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:48:44,767 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:48:44,778 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:48:44,779 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:48:44,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:44 BoogieIcfgContainer [2023-11-19 07:48:44,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:48:44,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:48:44,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:48:44,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:48:44,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:48:43" (1/3) ... [2023-11-19 07:48:44,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d7a09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:44, skipping insertion in model container [2023-11-19 07:48:44,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:43" (2/3) ... [2023-11-19 07:48:44,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d7a09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:44, skipping insertion in model container [2023-11-19 07:48:44,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:44" (3/3) ... [2023-11-19 07:48:44,794 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-3.i [2023-11-19 07:48:44,813 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:48:44,813 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:48:44,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:48:44,869 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;@140ec79b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:48:44,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:48:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:48:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-19 07:48:44,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:44,892 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:44,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:44,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1591917427, now seen corresponding path program 1 times [2023-11-19 07:48:44,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698499993] [2023-11-19 07:48:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698499993] [2023-11-19 07:48:45,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698499993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:45,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:45,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:48:45,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105481875] [2023-11-19 07:48:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:45,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:48:45,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:45,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:48:45,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:48:45,917 INFO L87 Difference]: Start difference. First operand has 149 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:46,100 INFO L93 Difference]: Finished difference Result 329 states and 512 transitions. [2023-11-19 07:48:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:48:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-19 07:48:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:46,131 INFO L225 Difference]: With dead ends: 329 [2023-11-19 07:48:46,144 INFO L226 Difference]: Without dead ends: 183 [2023-11-19 07:48:46,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:48:46,153 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 67 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:46,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 720 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:48:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-19 07:48:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 147. [2023-11-19 07:48:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:48:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2023-11-19 07:48:46,264 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2023-11-19 07:48:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:46,266 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2023-11-19 07:48:46,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2023-11-19 07:48:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-19 07:48:46,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:46,273 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:46,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:48:46,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:46,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1452189893, now seen corresponding path program 1 times [2023-11-19 07:48:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920428795] [2023-11-19 07:48:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:46,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:46,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920428795] [2023-11-19 07:48:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920428795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:46,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:46,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:48:46,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581827682] [2023-11-19 07:48:46,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:46,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:48:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:48:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:48:46,519 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:46,569 INFO L93 Difference]: Finished difference Result 368 states and 546 transitions. [2023-11-19 07:48:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:48:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2023-11-19 07:48:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:46,574 INFO L225 Difference]: With dead ends: 368 [2023-11-19 07:48:46,574 INFO L226 Difference]: Without dead ends: 224 [2023-11-19 07:48:46,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:48:46,578 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:46,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 412 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-19 07:48:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. [2023-11-19 07:48:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:48:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2023-11-19 07:48:46,603 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 135 [2023-11-19 07:48:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:46,604 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2023-11-19 07:48:46,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2023-11-19 07:48:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-19 07:48:46,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:46,609 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:46,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:48:46,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:46,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash 274308366, now seen corresponding path program 1 times [2023-11-19 07:48:46,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:46,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495806951] [2023-11-19 07:48:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495806951] [2023-11-19 07:48:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495806951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:47,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:47,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:47,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002533998] [2023-11-19 07:48:47,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:47,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:47,762 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:48:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:48,268 INFO L93 Difference]: Finished difference Result 531 states and 792 transitions. [2023-11-19 07:48:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:48:48,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2023-11-19 07:48:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:48,276 INFO L225 Difference]: With dead ends: 531 [2023-11-19 07:48:48,276 INFO L226 Difference]: Without dead ends: 355 [2023-11-19 07:48:48,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:48,281 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 302 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:48,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 601 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:48:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-11-19 07:48:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 347. [2023-11-19 07:48:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 312 states have (on average 1.4487179487179487) internal successors, (452), 312 states have internal predecessors, (452), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:48:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 516 transitions. [2023-11-19 07:48:48,372 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 516 transitions. Word has length 135 [2023-11-19 07:48:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:48,376 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 516 transitions. [2023-11-19 07:48:48,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:48:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 516 transitions. [2023-11-19 07:48:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-19 07:48:48,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:48,387 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:48,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:48:48,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:48,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1146031914, now seen corresponding path program 1 times [2023-11-19 07:48:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:48,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107516774] [2023-11-19 07:48:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-19 07:48:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107516774] [2023-11-19 07:48:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107516774] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:48:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70604208] [2023-11-19 07:48:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:50,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:50,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:50,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:48:50,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:48:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:50,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-19 07:48:50,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:48:51,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:48:51,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2023-11-19 07:48:51,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:48:51,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-19 07:48:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:51,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:48:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70604208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:48:51,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2023-11-19 07:48:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338150566] [2023-11-19 07:48:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:51,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:48:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:48:51,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:48:51,391 INFO L87 Difference]: Start difference. First operand 347 states and 516 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:52,591 INFO L93 Difference]: Finished difference Result 722 states and 1078 transitions. [2023-11-19 07:48:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:48:52,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-11-19 07:48:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:52,597 INFO L225 Difference]: With dead ends: 722 [2023-11-19 07:48:52,597 INFO L226 Difference]: Without dead ends: 546 [2023-11-19 07:48:52,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2023-11-19 07:48:52,599 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 772 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:52,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 866 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 07:48:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-11-19 07:48:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 405. [2023-11-19 07:48:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 370 states have (on average 1.4567567567567568) internal successors, (539), 370 states have internal predecessors, (539), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:48:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 603 transitions. [2023-11-19 07:48:52,643 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 603 transitions. Word has length 136 [2023-11-19 07:48:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:52,644 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 603 transitions. [2023-11-19 07:48:52,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 603 transitions. [2023-11-19 07:48:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-19 07:48:52,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:52,647 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 07:48:52,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:48:52,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:52,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -947868620, now seen corresponding path program 1 times [2023-11-19 07:48:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129468178] [2023-11-19 07:48:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:53,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:53,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129468178] [2023-11-19 07:48:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129468178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:53,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188702123] [2023-11-19 07:48:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:53,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:53,829 INFO L87 Difference]: Start difference. First operand 405 states and 603 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:54,216 INFO L93 Difference]: Finished difference Result 847 states and 1263 transitions. [2023-11-19 07:48:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:48:54,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-19 07:48:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:54,225 INFO L225 Difference]: With dead ends: 847 [2023-11-19 07:48:54,225 INFO L226 Difference]: Without dead ends: 445 [2023-11-19 07:48:54,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:48:54,229 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 334 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:54,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 618 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:48:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-11-19 07:48:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 405. [2023-11-19 07:48:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 370 states have (on average 1.454054054054054) internal successors, (538), 370 states have internal predecessors, (538), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:48:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 602 transitions. [2023-11-19 07:48:54,262 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 602 transitions. Word has length 137 [2023-11-19 07:48:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:54,262 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 602 transitions. [2023-11-19 07:48:54,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 602 transitions. [2023-11-19 07:48:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-19 07:48:54,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:54,265 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:54,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:48:54,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:54,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1853654964, now seen corresponding path program 1 times [2023-11-19 07:48:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:54,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274828624] [2023-11-19 07:48:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:54,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:54,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274828624] [2023-11-19 07:48:54,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274828624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:54,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:54,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:54,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487181662] [2023-11-19 07:48:54,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:54,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:54,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:54,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:54,509 INFO L87 Difference]: Start difference. First operand 405 states and 602 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:54,589 INFO L93 Difference]: Finished difference Result 968 states and 1441 transitions. [2023-11-19 07:48:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:48:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2023-11-19 07:48:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:54,596 INFO L225 Difference]: With dead ends: 968 [2023-11-19 07:48:54,596 INFO L226 Difference]: Without dead ends: 566 [2023-11-19 07:48:54,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:48:54,598 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 124 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:54,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 931 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-11-19 07:48:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 408. [2023-11-19 07:48:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 373 states have (on average 1.450402144772118) internal successors, (541), 373 states have internal predecessors, (541), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:48:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 605 transitions. [2023-11-19 07:48:54,628 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 605 transitions. Word has length 137 [2023-11-19 07:48:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:54,629 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 605 transitions. [2023-11-19 07:48:54,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 605 transitions. [2023-11-19 07:48:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-19 07:48:54,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:54,632 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:54,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:48:54,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:54,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2080709013, now seen corresponding path program 1 times [2023-11-19 07:48:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:54,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721457630] [2023-11-19 07:48:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:54,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721457630] [2023-11-19 07:48:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721457630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:48:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572689336] [2023-11-19 07:48:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:54,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:54,963 INFO L87 Difference]: Start difference. First operand 408 states and 605 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:55,066 INFO L93 Difference]: Finished difference Result 863 states and 1283 transitions. [2023-11-19 07:48:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:55,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-11-19 07:48:55,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:55,076 INFO L225 Difference]: With dead ends: 863 [2023-11-19 07:48:55,076 INFO L226 Difference]: Without dead ends: 458 [2023-11-19 07:48:55,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:48:55,078 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 144 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:55,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 796 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:48:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-11-19 07:48:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 414. [2023-11-19 07:48:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 379 states have (on average 1.4432717678100264) internal successors, (547), 379 states have internal predecessors, (547), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:48:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 611 transitions. [2023-11-19 07:48:55,111 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 611 transitions. Word has length 138 [2023-11-19 07:48:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:55,112 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 611 transitions. [2023-11-19 07:48:55,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 611 transitions. [2023-11-19 07:48:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-19 07:48:55,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:55,117 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:55,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:48:55,117 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:55,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1025040540, now seen corresponding path program 1 times [2023-11-19 07:48:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815367002] [2023-11-19 07:48:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:55,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815367002] [2023-11-19 07:48:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815367002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:56,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:48:56,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103990148] [2023-11-19 07:48:56,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:56,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:48:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:48:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:48:56,121 INFO L87 Difference]: Start difference. First operand 414 states and 611 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:57,407 INFO L93 Difference]: Finished difference Result 866 states and 1282 transitions. [2023-11-19 07:48:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:48:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-11-19 07:48:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:57,413 INFO L225 Difference]: With dead ends: 866 [2023-11-19 07:48:57,413 INFO L226 Difference]: Without dead ends: 627 [2023-11-19 07:48:57,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:48:57,416 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 542 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:57,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 675 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 07:48:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-11-19 07:48:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 584. [2023-11-19 07:48:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 532 states have (on average 1.4398496240601504) internal successors, (766), 532 states have internal predecessors, (766), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:48:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 862 transitions. [2023-11-19 07:48:57,467 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 862 transitions. Word has length 138 [2023-11-19 07:48:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:57,468 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 862 transitions. [2023-11-19 07:48:57,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 862 transitions. [2023-11-19 07:48:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-19 07:48:57,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:57,472 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:57,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:48:57,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:57,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -740161712, now seen corresponding path program 1 times [2023-11-19 07:48:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:57,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375949183] [2023-11-19 07:48:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:48:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:48:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:48:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:48:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:48:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:48:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:48:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:48:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:48:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:48:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:48:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:48:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:48:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:48:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:48:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:48:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:48:58,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375949183] [2023-11-19 07:48:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375949183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:58,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:48:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342513993] [2023-11-19 07:48:58,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:58,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:48:58,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:58,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:48:58,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:48:58,462 INFO L87 Difference]: Start difference. First operand 584 states and 862 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:48:59,655 INFO L93 Difference]: Finished difference Result 1239 states and 1833 transitions. [2023-11-19 07:48:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:48:59,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2023-11-19 07:48:59,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:48:59,663 INFO L225 Difference]: With dead ends: 1239 [2023-11-19 07:48:59,664 INFO L226 Difference]: Without dead ends: 772 [2023-11-19 07:48:59,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:48:59,669 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 1367 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:48:59,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 467 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 07:48:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2023-11-19 07:48:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 665. [2023-11-19 07:48:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 596 states have (on average 1.4228187919463087) internal successors, (848), 596 states have internal predecessors, (848), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-19 07:48:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 976 transitions. [2023-11-19 07:48:59,752 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 976 transitions. Word has length 138 [2023-11-19 07:48:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:48:59,753 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 976 transitions. [2023-11-19 07:48:59,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:48:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 976 transitions. [2023-11-19 07:48:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-19 07:48:59,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:48:59,757 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:59,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:48:59,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:48:59,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1076208110, now seen corresponding path program 1 times [2023-11-19 07:48:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681838865] [2023-11-19 07:48:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:49:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:49:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:49:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:49:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:49:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:49:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:49:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:49:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:49:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:49:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:49:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:49:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:49:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:49:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:49:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:49:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:49:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681838865] [2023-11-19 07:49:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681838865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 07:49:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316780329] [2023-11-19 07:49:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:01,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:49:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:01,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:49:01,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:49:01,447 INFO L87 Difference]: Start difference. First operand 665 states and 976 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:49:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:49:03,265 INFO L93 Difference]: Finished difference Result 1745 states and 2559 transitions. [2023-11-19 07:49:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:49:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2023-11-19 07:49:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:49:03,274 INFO L225 Difference]: With dead ends: 1745 [2023-11-19 07:49:03,274 INFO L226 Difference]: Without dead ends: 1083 [2023-11-19 07:49:03,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-11-19 07:49:03,277 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 552 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:49:03,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1365 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-19 07:49:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2023-11-19 07:49:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 791. [2023-11-19 07:49:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 722 states have (on average 1.4293628808864265) internal successors, (1032), 722 states have internal predecessors, (1032), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-19 07:49:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1160 transitions. [2023-11-19 07:49:03,344 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1160 transitions. Word has length 139 [2023-11-19 07:49:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:49:03,344 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 1160 transitions. [2023-11-19 07:49:03,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:49:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1160 transitions. [2023-11-19 07:49:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-19 07:49:03,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:49:03,348 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:49:03,348 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:49:03,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1777272688, now seen corresponding path program 1 times [2023-11-19 07:49:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:03,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675279438] [2023-11-19 07:49:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:49:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:49:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:49:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:49:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:49:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:03,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:49:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:03,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:49:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:49:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:49:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:49:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:49:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:49:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:49:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:49:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:49:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:49:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:49:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:04,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675279438] [2023-11-19 07:49:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675279438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:04,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:49:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899507363] [2023-11-19 07:49:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:04,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:49:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:49:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:49:04,033 INFO L87 Difference]: Start difference. First operand 791 states and 1160 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:49:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:49:04,807 INFO L93 Difference]: Finished difference Result 1871 states and 2741 transitions. [2023-11-19 07:49:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:49:04,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2023-11-19 07:49:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:49:04,815 INFO L225 Difference]: With dead ends: 1871 [2023-11-19 07:49:04,815 INFO L226 Difference]: Without dead ends: 1083 [2023-11-19 07:49:04,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:49:04,821 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 346 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:49:04,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 750 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:49:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2023-11-19 07:49:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 791. [2023-11-19 07:49:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 722 states have (on average 1.4265927977839334) internal successors, (1030), 722 states have internal predecessors, (1030), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-19 07:49:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1158 transitions. [2023-11-19 07:49:04,905 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1158 transitions. Word has length 139 [2023-11-19 07:49:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:49:04,906 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 1158 transitions. [2023-11-19 07:49:04,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:49:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1158 transitions. [2023-11-19 07:49:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-19 07:49:04,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:49:04,911 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:04,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:49:04,911 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:49:04,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash 258559660, now seen corresponding path program 1 times [2023-11-19 07:49:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884555295] [2023-11-19 07:49:04,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:49:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:49:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:49:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:49:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:49:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:49:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:49:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:49:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:49:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:49:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:49:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:49:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:49:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:49:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:49:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:49:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:49:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:05,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884555295] [2023-11-19 07:49:05,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884555295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:05,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:49:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103265758] [2023-11-19 07:49:05,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:05,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:49:05,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:05,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:49:05,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:49:05,664 INFO L87 Difference]: Start difference. First operand 791 states and 1158 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:49:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:49:06,392 INFO L93 Difference]: Finished difference Result 1801 states and 2635 transitions. [2023-11-19 07:49:06,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:49:06,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2023-11-19 07:49:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:49:06,400 INFO L225 Difference]: With dead ends: 1801 [2023-11-19 07:49:06,401 INFO L226 Difference]: Without dead ends: 1013 [2023-11-19 07:49:06,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:49:06,404 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 516 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:49:06,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 553 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:49:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2023-11-19 07:49:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 791. [2023-11-19 07:49:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 722 states have (on average 1.4238227146814404) internal successors, (1028), 722 states have internal predecessors, (1028), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-19 07:49:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1156 transitions. [2023-11-19 07:49:06,474 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1156 transitions. Word has length 139 [2023-11-19 07:49:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:49:06,475 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 1156 transitions. [2023-11-19 07:49:06,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:49:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1156 transitions. [2023-11-19 07:49:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-19 07:49:06,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:49:06,479 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:06,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:49:06,480 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:49:06,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash 959624238, now seen corresponding path program 1 times [2023-11-19 07:49:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:06,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844647249] [2023-11-19 07:49:06,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:06,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:49:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:49:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:49:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:49:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:49:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:49:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:49:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:49:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:49:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:49:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:49:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:49:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:49:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:49:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:49:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:49:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:49:08,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:08,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844647249] [2023-11-19 07:49:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844647249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:08,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-19 07:49:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842353255] [2023-11-19 07:49:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:08,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:49:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:08,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:49:08,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:49:08,068 INFO L87 Difference]: Start difference. First operand 791 states and 1156 transitions. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:49:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:49:09,983 INFO L93 Difference]: Finished difference Result 1801 states and 2631 transitions. [2023-11-19 07:49:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:49:09,984 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2023-11-19 07:49:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:49:09,991 INFO L225 Difference]: With dead ends: 1801 [2023-11-19 07:49:09,991 INFO L226 Difference]: Without dead ends: 1013 [2023-11-19 07:49:09,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-11-19 07:49:09,995 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 477 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:49:09,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1555 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-19 07:49:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2023-11-19 07:49:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 787. [2023-11-19 07:49:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 718 states have (on average 1.426183844011142) internal successors, (1024), 718 states have internal predecessors, (1024), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-19 07:49:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1152 transitions. [2023-11-19 07:49:10,062 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1152 transitions. Word has length 139 [2023-11-19 07:49:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:49:10,063 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1152 transitions. [2023-11-19 07:49:10,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:49:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1152 transitions. [2023-11-19 07:49:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-19 07:49:10,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:49:10,067 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:49:10,067 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:49:10,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash -673421807, now seen corresponding path program 1 times [2023-11-19 07:49:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:10,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375546634] [2023-11-19 07:49:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:10,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:49:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:49:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:49:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:49:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:49:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:49:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:49:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:49:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:49:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:49:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:49:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:49:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:49:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:49:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:49:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:49:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:49:10,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:10,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375546634] [2023-11-19 07:49:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375546634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:49:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7383847] [2023-11-19 07:49:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:10,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:49:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:10,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:49:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:49:10,197 INFO L87 Difference]: Start difference. First operand 787 states and 1152 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:49:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:49:10,260 INFO L93 Difference]: Finished difference Result 1565 states and 2278 transitions. [2023-11-19 07:49:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:49:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2023-11-19 07:49:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:49:10,267 INFO L225 Difference]: With dead ends: 1565 [2023-11-19 07:49:10,267 INFO L226 Difference]: Without dead ends: 755 [2023-11-19 07:49:10,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:49:10,270 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 103 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:49:10,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 507 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:49:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2023-11-19 07:49:10,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 393. [2023-11-19 07:49:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 358 states have (on average 1.4022346368715084) internal successors, (502), 358 states have internal predecessors, (502), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:49:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 566 transitions. [2023-11-19 07:49:10,307 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 566 transitions. Word has length 139 [2023-11-19 07:49:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:49:10,308 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 566 transitions. [2023-11-19 07:49:10,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:49:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 566 transitions. [2023-11-19 07:49:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-19 07:49:10,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:49:10,311 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:10,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:49:10,312 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:49:10,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash 741097882, now seen corresponding path program 1 times [2023-11-19 07:49:10,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:10,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399034783] [2023-11-19 07:49:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:10,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:49:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:49:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:49:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:49:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:49:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:49:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:49:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:49:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:49:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:49:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:49:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:49:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:49:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:49:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:49:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:49:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:49:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399034783] [2023-11-19 07:49:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399034783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-19 07:49:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016561731] [2023-11-19 07:49:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:12,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 07:49:12,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 07:49:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:49:12,569 INFO L87 Difference]: Start difference. First operand 393 states and 566 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-19 07:49:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:49:14,656 INFO L93 Difference]: Finished difference Result 1149 states and 1664 transitions. [2023-11-19 07:49:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-19 07:49:14,657 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 140 [2023-11-19 07:49:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:49:14,663 INFO L225 Difference]: With dead ends: 1149 [2023-11-19 07:49:14,663 INFO L226 Difference]: Without dead ends: 759 [2023-11-19 07:49:14,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2023-11-19 07:49:14,667 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 1565 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:49:14,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 1051 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-19 07:49:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-11-19 07:49:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 454. [2023-11-19 07:49:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 419 states have (on average 1.4105011933174225) internal successors, (591), 419 states have internal predecessors, (591), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:49:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 655 transitions. [2023-11-19 07:49:14,711 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 655 transitions. Word has length 140 [2023-11-19 07:49:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:49:14,712 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 655 transitions. [2023-11-19 07:49:14,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-19 07:49:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 655 transitions. [2023-11-19 07:49:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-19 07:49:14,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:49:14,716 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:14,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:49:14,716 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:49:14,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:14,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1575751236, now seen corresponding path program 1 times [2023-11-19 07:49:14,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:14,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431158524] [2023-11-19 07:49:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:49:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:49:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:49:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:49:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:49:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:49:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:49:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:49:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:49:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:49:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:49:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:49:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:49:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:49:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:49:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:49:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:49:15,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:15,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431158524] [2023-11-19 07:49:15,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431158524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:15,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:15,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:49:15,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863357169] [2023-11-19 07:49:15,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:15,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:49:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:49:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:49:15,754 INFO L87 Difference]: Start difference. First operand 454 states and 655 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:49:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:49:16,877 INFO L93 Difference]: Finished difference Result 1288 states and 1867 transitions. [2023-11-19 07:49:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:49:16,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2023-11-19 07:49:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:49:16,883 INFO L225 Difference]: With dead ends: 1288 [2023-11-19 07:49:16,884 INFO L226 Difference]: Without dead ends: 837 [2023-11-19 07:49:16,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:49:16,886 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 542 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:49:16,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 677 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 07:49:16,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2023-11-19 07:49:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 789. [2023-11-19 07:49:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 728 states have (on average 1.4134615384615385) internal successors, (1029), 730 states have internal predecessors, (1029), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-19 07:49:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1141 transitions. [2023-11-19 07:49:16,949 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1141 transitions. Word has length 140 [2023-11-19 07:49:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:49:16,949 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1141 transitions. [2023-11-19 07:49:16,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:49:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1141 transitions. [2023-11-19 07:49:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-19 07:49:16,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:49:16,953 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:49:16,953 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:49:16,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1595324151, now seen corresponding path program 1 times [2023-11-19 07:49:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:16,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426830322] [2023-11-19 07:49:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:49:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:49:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:49:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:49:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:49:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:49:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:49:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:49:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:49:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:49:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:49:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:49:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:49:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:49:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:49:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:49:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-19 07:49:18,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426830322] [2023-11-19 07:49:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426830322] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:49:18,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108932975] [2023-11-19 07:49:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:18,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:49:18,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:49:18,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:49:18,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd173c24-08e4-4d4e-b1f8-25ceecf35c20/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:49:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:18,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-19 07:49:18,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:49:18,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 07:49:18,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-11-19 07:49:19,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:19,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:49:19,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:19,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:49:19,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:19,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:49:19,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:19,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:49:19,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:19,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:49:19,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:19,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:49:20,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:20,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:49:20,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:20,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:49:20,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2023-11-19 07:49:20,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:20,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-19 07:49:20,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:49:20,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-19 07:49:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-11-19 07:49:20,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:49:20,877 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_972 (Array Int Int))) (< 0 (mod (select (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_972) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256))) is different from false [2023-11-19 07:49:20,991 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (= (mod (select .cse1 (+ 2 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) 256) 0))) (and (or .cse0 (forall ((v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse1 |c_~#BOOL_unsigned_char_Array_0~0.offset| 0)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_971) |c_~#double_Array_0~0.base| v_ArrVal_972) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256)))) (or (not .cse0) (forall ((v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse1 |c_~#BOOL_unsigned_char_Array_0~0.offset| 1)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_971) |c_~#double_Array_0~0.base| v_ArrVal_972) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256))))))) is different from false [2023-11-19 07:49:21,077 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse1 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (= (mod (select .cse1 (+ 2 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) 256) 0))) (and (or .cse0 (forall ((v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse1 |c_~#BOOL_unsigned_char_Array_0~0.offset| 0)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_971) |c_~#double_Array_0~0.base| v_ArrVal_972) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256)))) (or (not .cse0) (forall ((v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse1 |c_~#BOOL_unsigned_char_Array_0~0.offset| 1)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_971) |c_~#double_Array_0~0.base| v_ArrVal_972) |c_~#BOOL_unsigned_char_Array_0~0.base|) |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256))))))) (= (mod c_~last_1_BOOL_unsigned_char_Array_0_0__0_~0 256) 0)) is different from false [2023-11-19 07:49:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108932975] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:49:21,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:49:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2023-11-19 07:49:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957484955] [2023-11-19 07:49:21,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:49:21,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 07:49:21,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:21,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 07:49:21,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=420, Unknown=9, NotChecked=132, Total=650 [2023-11-19 07:49:21,193 INFO L87 Difference]: Start difference. First operand 789 states and 1141 transitions. Second operand has 20 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32)