./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/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_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/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_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/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 9264bbfdf2a1620837a07867e3cbb7cf72b4482249c5838c21d858e0ef02c20c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:38:43,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:38:43,216 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:38:43,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:38:43,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:38:43,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:38:43,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:38:43,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:38:43,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:38:43,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:38:43,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:38:43,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:38:43,251 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:38:43,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:38:43,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:38:43,253 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:38:43,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:38:43,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:38:43,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:38:43,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:38:43,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:38:43,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:38:43,260 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:38:43,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:38:43,261 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:38:43,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:38:43,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:38:43,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:38:43,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:43,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:38:43,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:38:43,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:38:43,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:38:43,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:38:43,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:38:43,267 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:38:43,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:38:43,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:38:43,267 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:38:43,268 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_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/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_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/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 -> 9264bbfdf2a1620837a07867e3cbb7cf72b4482249c5838c21d858e0ef02c20c [2023-11-19 07:38:43,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:38:43,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:38:43,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:38:43,640 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:38:43,641 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:38:43,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2023-11-19 07:38:46,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:38:47,099 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:38:47,100 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i [2023-11-19 07:38:47,118 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/data/88d956113/46b06a66ab4340bea7d24e35f6128aa7/FLAG3c505e870 [2023-11-19 07:38:47,135 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/data/88d956113/46b06a66ab4340bea7d24e35f6128aa7 [2023-11-19 07:38:47,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:38:47,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:38:47,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:47,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:38:47,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:38:47,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ae3fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47, skipping insertion in model container [2023-11-19 07:38:47,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,204 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:38:47,349 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_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i[917,930] [2023-11-19 07:38:47,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:47,472 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:38:47,484 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_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-24.i[917,930] [2023-11-19 07:38:47,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:38:47,560 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:38:47,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47 WrapperNode [2023-11-19 07:38:47,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:38:47,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:47,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:38:47,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:38:47,569 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:38:47" (1/1) ... [2023-11-19 07:38:47,584 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:38:47" (1/1) ... [2023-11-19 07:38:47,644 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2023-11-19 07:38:47,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:38:47,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:38:47,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:38:47,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:38:47,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:38:47,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:38:47,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:38:47,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:38:47,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (1/1) ... [2023-11-19 07:38:47,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:38:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:38:47,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/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:38:47,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/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:38:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:38:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:38:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:38:47,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:38:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:38:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:38:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:38:47,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:38:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:38:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:38:47,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:38:48,003 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:38:48,009 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:38:48,785 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:38:48,801 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:38:48,802 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:38:48,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:48 BoogieIcfgContainer [2023-11-19 07:38:48,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:38:48,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:38:48,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:38:48,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:38:48,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:38:47" (1/3) ... [2023-11-19 07:38:48,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aab1f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:48, skipping insertion in model container [2023-11-19 07:38:48,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:38:47" (2/3) ... [2023-11-19 07:38:48,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aab1f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:38:48, skipping insertion in model container [2023-11-19 07:38:48,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:38:48" (3/3) ... [2023-11-19 07:38:48,824 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-24.i [2023-11-19 07:38:48,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:38:48,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:38:48,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:38:48,914 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;@5dfd8464, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:38:48,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:38:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:38:48,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:48,945 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:48,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash 517644707, now seen corresponding path program 1 times [2023-11-19 07:38:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:48,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356138615] [2023-11-19 07:38:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:48,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356138615] [2023-11-19 07:38:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356138615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:38:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141155082] [2023-11-19 07:38:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:49,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:38:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:38:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:38:49,581 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:38:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:49,630 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2023-11-19 07:38:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:38:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:38:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:49,644 INFO L225 Difference]: With dead ends: 195 [2023-11-19 07:38:49,644 INFO L226 Difference]: Without dead ends: 97 [2023-11-19 07:38:49,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:38:49,652 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:49,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-19 07:38:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-19 07:38:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-11-19 07:38:49,720 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2023-11-19 07:38:49,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:49,721 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-11-19 07:38:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:38:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-11-19 07:38:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:38:49,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:49,727 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:38:49,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:49,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash -94639779, now seen corresponding path program 1 times [2023-11-19 07:38:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:49,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404906708] [2023-11-19 07:38:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:49,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:50,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404906708] [2023-11-19 07:38:50,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404906708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:50,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113170295] [2023-11-19 07:38:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:50,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:50,266 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:38:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:50,322 INFO L93 Difference]: Finished difference Result 197 states and 284 transitions. [2023-11-19 07:38:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:50,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:38:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:50,325 INFO L225 Difference]: With dead ends: 197 [2023-11-19 07:38:50,325 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 07:38:50,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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:38:50,327 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 10 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:50,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 07:38:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2023-11-19 07:38:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-11-19 07:38:50,346 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2023-11-19 07:38:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:50,347 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-11-19 07:38:50,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:38:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-11-19 07:38:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:38:50,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:50,350 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:50,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:38:50,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:50,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1419495973, now seen corresponding path program 1 times [2023-11-19 07:38:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422215587] [2023-11-19 07:38:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422215587] [2023-11-19 07:38:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422215587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:50,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239224402] [2023-11-19 07:38:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:50,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:38:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:50,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:38:50,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:50,609 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:50,657 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2023-11-19 07:38:50,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:38:50,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:38:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:50,660 INFO L225 Difference]: With dead ends: 196 [2023-11-19 07:38:50,660 INFO L226 Difference]: Without dead ends: 100 [2023-11-19 07:38:50,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:38:50,663 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:50,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-19 07:38:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-19 07:38:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2023-11-19 07:38:50,687 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2023-11-19 07:38:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:50,688 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2023-11-19 07:38:50,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2023-11-19 07:38:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:38:50,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:50,691 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:50,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:38:50,691 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:50,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1070032989, now seen corresponding path program 1 times [2023-11-19 07:38:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923478459] [2023-11-19 07:38:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:50,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923478459] [2023-11-19 07:38:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923478459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:50,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:38:50,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348060825] [2023-11-19 07:38:50,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:50,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:38:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:50,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:38:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:38:50,916 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:50,952 INFO L93 Difference]: Finished difference Result 217 states and 311 transitions. [2023-11-19 07:38:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:38:50,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:38:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:50,960 INFO L225 Difference]: With dead ends: 217 [2023-11-19 07:38:50,960 INFO L226 Difference]: Without dead ends: 120 [2023-11-19 07:38:50,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:38:50,970 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:50,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 286 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-19 07:38:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2023-11-19 07:38:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-19 07:38:50,992 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2023-11-19 07:38:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:50,993 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-19 07:38:50,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-19 07:38:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:38:50,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:50,996 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:50,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:38:50,997 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:50,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash 48964635, now seen corresponding path program 1 times [2023-11-19 07:38:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417411941] [2023-11-19 07:38:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:51,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417411941] [2023-11-19 07:38:51,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417411941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:51,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:51,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184475875] [2023-11-19 07:38:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:51,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:51,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:51,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:51,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:51,249 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:51,290 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2023-11-19 07:38:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:38:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:51,292 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:38:51,292 INFO L226 Difference]: Without dead ends: 113 [2023-11-19 07:38:51,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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:38:51,298 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 21 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 404 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.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:51,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 404 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-19 07:38:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2023-11-19 07:38:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2023-11-19 07:38:51,320 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2023-11-19 07:38:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:51,320 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2023-11-19 07:38:51,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2023-11-19 07:38:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:38:51,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:51,323 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:38:51,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:51,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash 729023005, now seen corresponding path program 1 times [2023-11-19 07:38:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:51,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831434876] [2023-11-19 07:38:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:51,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831434876] [2023-11-19 07:38:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831434876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72139951] [2023-11-19 07:38:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:51,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:51,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:51,565 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:51,607 INFO L93 Difference]: Finished difference Result 211 states and 298 transitions. [2023-11-19 07:38:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:51,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:38:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:51,611 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:38:51,611 INFO L226 Difference]: Without dead ends: 111 [2023-11-19 07:38:51,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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:38:51,616 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 12 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:51,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 402 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-19 07:38:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2023-11-19 07:38:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2023-11-19 07:38:51,635 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2023-11-19 07:38:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:51,636 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2023-11-19 07:38:51,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2023-11-19 07:38:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:38:51,638 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:51,639 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:38:51,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:51,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:51,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1790936929, now seen corresponding path program 1 times [2023-11-19 07:38:51,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228161131] [2023-11-19 07:38:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:51,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:51,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:51,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228161131] [2023-11-19 07:38:51,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228161131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:51,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:51,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:38:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883995745] [2023-11-19 07:38:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:51,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:38:51,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:51,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:38:51,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:38:51,829 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:51,857 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2023-11-19 07:38:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:51,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:38:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:51,860 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:38:51,860 INFO L226 Difference]: Without dead ends: 109 [2023-11-19 07:38:51,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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:38:51,861 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:51,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 401 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:38:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-19 07:38:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-11-19 07:38:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2023-11-19 07:38:51,868 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2023-11-19 07:38:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:51,869 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2023-11-19 07:38:51,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2023-11-19 07:38:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:38:51,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:51,871 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:38:51,871 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:51,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1789089887, now seen corresponding path program 1 times [2023-11-19 07:38:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521628243] [2023-11-19 07:38:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521628243] [2023-11-19 07:38:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521628243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:38:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630417794] [2023-11-19 07:38:52,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:52,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:38:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:52,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:38:52,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:38:52,680 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:38:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:53,153 INFO L93 Difference]: Finished difference Result 286 states and 397 transitions. [2023-11-19 07:38:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:38:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:38:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:53,156 INFO L225 Difference]: With dead ends: 286 [2023-11-19 07:38:53,156 INFO L226 Difference]: Without dead ends: 182 [2023-11-19 07:38:53,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:38:53,158 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 252 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:53,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 428 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:38:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-19 07:38:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 116. [2023-11-19 07:38:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2023-11-19 07:38:53,169 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 124 [2023-11-19 07:38:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:53,169 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2023-11-19 07:38:53,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:38:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2023-11-19 07:38:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:38:53,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:53,172 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:53,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:38:53,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:53,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:53,173 INFO L85 PathProgramCache]: Analyzing trace with hash 379764372, now seen corresponding path program 1 times [2023-11-19 07:38:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:53,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778325222] [2023-11-19 07:38:53,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:53,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:54,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:54,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778325222] [2023-11-19 07:38:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778325222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:54,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:54,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:38:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262924285] [2023-11-19 07:38:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:38:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:54,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:38:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:38:54,029 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:54,537 INFO L93 Difference]: Finished difference Result 310 states and 432 transitions. [2023-11-19 07:38:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:38:54,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-19 07:38:54,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:54,540 INFO L225 Difference]: With dead ends: 310 [2023-11-19 07:38:54,540 INFO L226 Difference]: Without dead ends: 197 [2023-11-19 07:38:54,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:38:54,541 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 343 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:54,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 428 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:38:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-11-19 07:38:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 129. [2023-11-19 07:38:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2023-11-19 07:38:54,554 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 125 [2023-11-19 07:38:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:54,555 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2023-11-19 07:38:54,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2023-11-19 07:38:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:38:54,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:54,558 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:54,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:38:54,558 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:54,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:54,559 INFO L85 PathProgramCache]: Analyzing trace with hash 245750866, now seen corresponding path program 1 times [2023-11-19 07:38:54,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:54,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968408301] [2023-11-19 07:38:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968408301] [2023-11-19 07:38:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968408301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:54,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:38:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366860953] [2023-11-19 07:38:54,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:54,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:54,981 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:55,199 INFO L93 Difference]: Finished difference Result 257 states and 361 transitions. [2023-11-19 07:38:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:38:55,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-11-19 07:38:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:55,202 INFO L225 Difference]: With dead ends: 257 [2023-11-19 07:38:55,202 INFO L226 Difference]: Without dead ends: 131 [2023-11-19 07:38:55,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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:38:55,204 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 14 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:55,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 424 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:38:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-19 07:38:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2023-11-19 07:38:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 112 states have internal predecessors, (150), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2023-11-19 07:38:55,217 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 125 [2023-11-19 07:38:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:55,218 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2023-11-19 07:38:55,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2023-11-19 07:38:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:38:55,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:55,220 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:55,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:38:55,221 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:55,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1336086526, now seen corresponding path program 1 times [2023-11-19 07:38:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:55,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788537829] [2023-11-19 07:38:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:55,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788537829] [2023-11-19 07:38:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788537829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:38:55,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126879871] [2023-11-19 07:38:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:55,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:38:55,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:55,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:38:55,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:38:55,976 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:56,399 INFO L93 Difference]: Finished difference Result 350 states and 486 transitions. [2023-11-19 07:38:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:38:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:38:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:56,402 INFO L225 Difference]: With dead ends: 350 [2023-11-19 07:38:56,402 INFO L226 Difference]: Without dead ends: 224 [2023-11-19 07:38:56,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:38:56,404 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 391 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:56,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 332 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:38:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-19 07:38:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 131. [2023-11-19 07:38:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2023-11-19 07:38:56,417 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 126 [2023-11-19 07:38:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:56,418 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2023-11-19 07:38:56,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2023-11-19 07:38:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:38:56,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:56,420 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:38:56,421 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:56,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -658058180, now seen corresponding path program 1 times [2023-11-19 07:38:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417213991] [2023-11-19 07:38:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:56,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:56,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417213991] [2023-11-19 07:38:56,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417213991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:56,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:56,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:38:56,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891456599] [2023-11-19 07:38:56,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:56,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:38:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:38:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:38:56,862 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:57,120 INFO L93 Difference]: Finished difference Result 350 states and 481 transitions. [2023-11-19 07:38:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:38:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:38:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:57,123 INFO L225 Difference]: With dead ends: 350 [2023-11-19 07:38:57,124 INFO L226 Difference]: Without dead ends: 222 [2023-11-19 07:38:57,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:38:57,125 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 213 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:57,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 347 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:38:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-19 07:38:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 132. [2023-11-19 07:38:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2023-11-19 07:38:57,139 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 126 [2023-11-19 07:38:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:57,140 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2023-11-19 07:38:57,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2023-11-19 07:38:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:38:57,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:57,142 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:57,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:38:57,143 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:57,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:57,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1414004056, now seen corresponding path program 1 times [2023-11-19 07:38:57,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:57,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275804045] [2023-11-19 07:38:57,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:57,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:38:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:38:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:38:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:38:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:38:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:38:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:38:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:38:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:38:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:38:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:38:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:38:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:38:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:38:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:38:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:38:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:38:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:38:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275804045] [2023-11-19 07:38:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275804045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:38:58,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:38:58,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:38:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173881542] [2023-11-19 07:38:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:38:58,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:38:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:38:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:38:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:38:58,236 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:38:58,714 INFO L93 Difference]: Finished difference Result 333 states and 458 transitions. [2023-11-19 07:38:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:38:58,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-19 07:38:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:38:58,716 INFO L225 Difference]: With dead ends: 333 [2023-11-19 07:38:58,716 INFO L226 Difference]: Without dead ends: 204 [2023-11-19 07:38:58,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:38:58,718 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 334 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:38:58,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 473 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:38:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-19 07:38:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 136. [2023-11-19 07:38:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:38:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2023-11-19 07:38:58,731 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 126 [2023-11-19 07:38:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:38:58,732 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2023-11-19 07:38:58,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:38:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2023-11-19 07:38:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:38:58,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:38:58,734 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:38:58,735 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:38:58,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:38:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1749076431, now seen corresponding path program 1 times [2023-11-19 07:38:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:38:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19370107] [2023-11-19 07:38:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:38:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:38:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:39:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:39:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:39:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:39:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:39:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:39:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:39:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:39:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:39:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:39:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:39:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:39:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:39:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:39:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:39:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:39:00,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:00,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19370107] [2023-11-19 07:39:00,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19370107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:00,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:00,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:39:00,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885525172] [2023-11-19 07:39:00,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:00,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:00,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:00,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:00,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:00,396 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:39:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:01,102 INFO L93 Difference]: Finished difference Result 344 states and 473 transitions. [2023-11-19 07:39:01,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:39:01,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-11-19 07:39:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:01,105 INFO L225 Difference]: With dead ends: 344 [2023-11-19 07:39:01,105 INFO L226 Difference]: Without dead ends: 211 [2023-11-19 07:39:01,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:39:01,107 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 238 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:01,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 599 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:39:01,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-19 07:39:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 145. [2023-11-19 07:39:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.328125) internal successors, (170), 128 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:39:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2023-11-19 07:39:01,125 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 127 [2023-11-19 07:39:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:01,126 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2023-11-19 07:39:01,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:39:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2023-11-19 07:39:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-19 07:39:01,129 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:01,129 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:39:01,130 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:01,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash -204199717, now seen corresponding path program 1 times [2023-11-19 07:39:01,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:01,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714873583] [2023-11-19 07:39:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:39:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:39:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:39:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:39:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:39:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:39:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:39:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:39:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:39:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:39:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:39:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:39:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:39:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:39:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:39:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:39:01,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:01,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714873583] [2023-11-19 07:39:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714873583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:01,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:01,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:39:01,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719518090] [2023-11-19 07:39:01,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:01,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:01,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:01,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:01,931 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:39:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:02,373 INFO L93 Difference]: Finished difference Result 359 states and 493 transitions. [2023-11-19 07:39:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:39:02,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2023-11-19 07:39:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:02,377 INFO L225 Difference]: With dead ends: 359 [2023-11-19 07:39:02,378 INFO L226 Difference]: Without dead ends: 217 [2023-11-19 07:39:02,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:02,381 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 333 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:02,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 408 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:39:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-19 07:39:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 147. [2023-11-19 07:39:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:39:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2023-11-19 07:39:02,402 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 127 [2023-11-19 07:39:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:02,403 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2023-11-19 07:39:02,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:39:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2023-11-19 07:39:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-19 07:39:02,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:02,406 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:39:02,407 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:02,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1046338064, now seen corresponding path program 1 times [2023-11-19 07:39:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104344276] [2023-11-19 07:39:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:39:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:39:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:39:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:39:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:39:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:39:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:39:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:39:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:39:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:39:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:39:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:39:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:39:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:39:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:39:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:39:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104344276] [2023-11-19 07:39:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104344276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:02,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:02,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:39:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367107812] [2023-11-19 07:39:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:02,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:02,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:02,728 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:39:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:02,793 INFO L93 Difference]: Finished difference Result 307 states and 424 transitions. [2023-11-19 07:39:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:02,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-19 07:39:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:02,796 INFO L225 Difference]: With dead ends: 307 [2023-11-19 07:39:02,797 INFO L226 Difference]: Without dead ends: 163 [2023-11-19 07:39:02,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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:39:02,798 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 42 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:02,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 532 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-19 07:39:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2023-11-19 07:39:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 133 states have internal predecessors, (176), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:39:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2023-11-19 07:39:02,820 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 128 [2023-11-19 07:39:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:02,821 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2023-11-19 07:39:02,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:39:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2023-11-19 07:39:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-19 07:39:02,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:02,824 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:39:02,824 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:02,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:02,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1016317253, now seen corresponding path program 1 times [2023-11-19 07:39:02,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:02,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932437124] [2023-11-19 07:39:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:39:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:39:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:39:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:39:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:39:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:39:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:39:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:39:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:39:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:39:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:39:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:39:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:39:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:39:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:39:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:39:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932437124] [2023-11-19 07:39:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932437124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:39:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140452584] [2023-11-19 07:39:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:03,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:03,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:03,511 INFO L87 Difference]: Start difference. First operand 150 states and 206 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:39:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:03,917 INFO L93 Difference]: Finished difference Result 369 states and 502 transitions. [2023-11-19 07:39:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:03,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-19 07:39:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:03,919 INFO L225 Difference]: With dead ends: 369 [2023-11-19 07:39:03,919 INFO L226 Difference]: Without dead ends: 222 [2023-11-19 07:39:03,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:39:03,921 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 436 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:03,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 347 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:39:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-19 07:39:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 146. [2023-11-19 07:39:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.317829457364341) internal successors, (170), 129 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:39:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2023-11-19 07:39:03,940 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 128 [2023-11-19 07:39:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:03,940 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2023-11-19 07:39:03,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:39:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2023-11-19 07:39:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:39:03,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:03,943 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:39:03,943 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:03,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash -297850184, now seen corresponding path program 1 times [2023-11-19 07:39:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:03,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556045865] [2023-11-19 07:39:03,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:39:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:39:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:39:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:39:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:39:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:39:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:39:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:39:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:39:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:39:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:39:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:39:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:39:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:39:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:39:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-11-19 07:39:09,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556045865] [2023-11-19 07:39:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556045865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329720627] [2023-11-19 07:39:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:09,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:09,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a80cda-fd3d-49d6-b01e-d89a8fb95c48/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:39:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:10,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-19 07:39:10,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:14,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:39:15,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-19 07:39:17,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:17,617 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 39 treesize of output 28 [2023-11-19 07:39:18,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:18,568 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 39 treesize of output 28 [2023-11-19 07:39:18,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:18,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 60 [2023-11-19 07:39:18,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:18,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:18,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:18,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:18,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2023-11-19 07:39:18,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2023-11-19 07:39:19,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:19,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:19,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:19,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 98 [2023-11-19 07:39:20,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:20,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:20,101 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 07:39:20,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 112 [2023-11-19 07:39:20,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-11-19 07:39:20,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:20,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:20,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:39:20,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 348 treesize of output 188 [2023-11-19 07:39:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 126 proven. 170 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-19 07:39:20,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:21,069 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse1 (mod (+ (* 255 (select (select .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)) (select (select .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256))) (or (= (select (select .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset) .cse1) (< 127 .cse1))))) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse2 (select (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset)) (.cse3 (mod (+ (* 255 (select (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)) (select (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256))) (or (= .cse2 .cse3) (= (+ 256 .cse2) .cse3))))) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse5 (mod (+ (* 255 (select (select .cse6 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)) (select (select .cse6 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256))) (or (< .cse5 128) (not (= (select (select .cse6 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset) .cse5))))))) is different from false [2023-11-19 07:39:23,856 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base)) (.cse7 (select (select |c_#memory_int| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) (and (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int))) (let ((.cse4 (let ((.cse5 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store .cse6 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset .cse7)) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse5 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse5 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse5 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse0 (mod (+ (select (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< 127 .cse0) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse3 (store (store .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset .cse0)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse1 (mod (+ (* 255 (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)) (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256)) (.cse2 (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset))) (or (= .cse1 .cse2) (= .cse1 (+ 256 .cse2)))))))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store .cse6 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset .cse7)) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse13 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse13 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse13 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse12 (mod (+ (select (select .cse11 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse11 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse10 (store (store .cse11 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse11 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset (+ (- 256) .cse12))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse9 (select (select .cse10 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset)) (.cse8 (mod (+ (* (select (select .cse10 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) 255) (select (select .cse10 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256))) (or (= .cse8 .cse9) (= (+ 256 .cse9) .cse8))))) (< .cse12 128))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store .cse6 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset .cse7)) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse18 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse18 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse18 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse14 (mod (+ (select (select .cse17 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse17 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< .cse14 128) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse16 (store (store .cse17 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse17 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset (+ (- 256) .cse14))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse15 (mod (+ (* (select (select .cse16 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) 255) (select (select .cse16 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256))) (or (< 127 .cse15) (= .cse15 (select (select .cse16 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset)))))))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int))) (let ((.cse21 (let ((.cse23 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store .cse6 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset .cse7)) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse23 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse23 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse23 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse22 (mod (+ (select (select .cse21 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse21 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse20 (store (store .cse21 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse21 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset .cse22)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse19 (mod (+ (* 255 (select (select .cse20 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)) (select (select .cse20 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256))) (or (= .cse19 (select (select .cse20 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset)) (< 127 .cse19))))) (< 127 .cse22))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int))) (let ((.cse26 (let ((.cse28 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store .cse6 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset .cse7)) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse28 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse28 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse28 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse27 (mod (+ (select (select .cse26 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse26 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse25 (store (store .cse26 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse26 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset .cse27)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse24 (mod (+ (* 255 (select (select .cse25 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)) (select (select .cse25 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256))) (or (not (= .cse24 (select (select .cse25 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset))) (< .cse24 128))))) (< 127 .cse27))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int))) (let ((.cse31 (let ((.cse33 (store (store |c_#memory_int| c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store .cse6 ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset .cse7)) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse33 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse33 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse33 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse32 (mod (+ (select (select .cse31 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse31 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse30 (store (store .cse31 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse31 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset (+ (- 256) .cse32))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse29 (mod (+ (* (select (select .cse30 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset) 255) (select (select .cse30 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)) 256))) (or (< .cse29 128) (not (= .cse29 (select (select .cse30 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset))))))) (< .cse32 128))))))) is different from false [2023-11-19 07:39:25,022 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store (let ((.cse5 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1012))) (store .cse5 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse5 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (select (select .cse5 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse0 (mod (+ (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< 127 .cse0) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse2 (store (store .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset .cse0)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse1 (mod (+ (select (select .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (not (= .cse1 (select (select .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset))) (< .cse1 128))))))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse9 (let ((.cse10 (store (let ((.cse11 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1012))) (store .cse11 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse11 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (select (select .cse11 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse10 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse10 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse10 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse6 (mod (+ (select (select .cse9 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse9 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< .cse6 128) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse8 (store (store .cse9 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse9 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset (+ (- 256) .cse6))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse7 (mod (+ (select (select .cse8 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse8 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< 127 .cse7) (= .cse7 (select (select .cse8 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset)))))))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse15 (let ((.cse16 (store (let ((.cse17 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1012))) (store .cse17 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse17 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (select (select .cse17 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse16 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse16 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse16 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse12 (mod (+ (select (select .cse15 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse15 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< .cse12 128) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse14 (store (store .cse15 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse15 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset (+ (- 256) .cse12))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse13 (mod (+ (select (select .cse14 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse14 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (not (= .cse13 (select (select .cse14 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset))) (< .cse13 128))))))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse22 (let ((.cse23 (store (let ((.cse24 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1012))) (store .cse24 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse24 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (select (select .cse24 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse23 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse23 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse23 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse18 (mod (+ (select (select .cse22 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse22 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< 127 .cse18) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse21 (store (store .cse22 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse22 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset .cse18)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse20 (mod (+ (select (select .cse21 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse21 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256)) (.cse19 (select (select .cse21 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset))) (or (= (+ 256 .cse19) .cse20) (= .cse20 .cse19))))))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse29 (let ((.cse30 (store (let ((.cse31 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1012))) (store .cse31 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse31 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (select (select .cse31 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse30 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse30 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse30 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse25 (mod (+ (select (select .cse29 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse29 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< .cse25 128) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse28 (store (store .cse29 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse29 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset (+ (- 256) .cse25))) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse26 (mod (+ (select (select .cse28 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse28 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256)) (.cse27 (select (select .cse28 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset))) (or (= .cse26 (+ 256 .cse27)) (= .cse26 .cse27))))))))) (forall ((~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse35 (let ((.cse36 (store (let ((.cse37 (store |c_#memory_int| c_~BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer~0.base v_ArrVal_1012))) (store .cse37 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base (store (select .cse37 c_~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.base) ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0.offset (select (select .cse37 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset)))) c_~float_Array_0_arrayfloat_Array_0arrayVar0_Pointer~0.base v_ArrVal_1015))) (store .cse36 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base (store (select .cse36 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset (select (select .cse36 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset)))))) (let ((.cse32 (mod (+ (select (select .cse35 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse35 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< 127 .cse32) (forall ((v_ArrVal_1019 (Array Int Int))) (let ((.cse34 (store (store .cse35 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base (store (select .cse35 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset .cse32)) c_~unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer~0.base v_ArrVal_1019))) (let ((.cse33 (mod (+ (select (select .cse34 c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer~0.offset) (* 255 (select (select .cse34 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) 256))) (or (< 127 .cse33) (= .cse33 (select (select .cse34 c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var4_Pointer~0.offset))))))))))) is different from false [2023-11-19 07:39:26,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329720627] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:26,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:39:26,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 45 [2023-11-19 07:39:26,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135929710] [2023-11-19 07:39:26,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:26,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-19 07:39:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:26,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-19 07:39:26,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1928, Unknown=6, NotChecked=276, Total=2450 [2023-11-19 07:39:26,040 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand has 45 states, 40 states have (on average 3.05) internal successors, (122), 39 states have internal predecessors, (122), 13 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 13 states have call successors, (30)