./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/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_0843e235-d050-4eec-9d07-c20ac7e97149/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/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_0843e235-d050-4eec-9d07-c20ac7e97149/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 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:54:31,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:54:31,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:54:31,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:54:31,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:54:32,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:54:32,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:54:32,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:54:32,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:54:32,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:54:32,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:54:32,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:54:32,022 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:54:32,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:54:32,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:54:32,025 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:54:32,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:54:32,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:54:32,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:54:32,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:54:32,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:54:32,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:54:32,028 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:54:32,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:54:32,029 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:54:32,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:54:32,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:54:32,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:54:32,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:54:32,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:54:32,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:54:32,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:54:32,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:54:32,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:54:32,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:54:32,034 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:54:32,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:54:32,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:54:32,034 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:54:32,034 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_0843e235-d050-4eec-9d07-c20ac7e97149/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_0843e235-d050-4eec-9d07-c20ac7e97149/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 -> 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 [2023-11-19 07:54:32,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:54:32,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:54:32,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:54:32,444 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:54:32,445 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:54:32,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2023-11-19 07:54:35,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:54:35,841 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:54:35,843 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2023-11-19 07:54:35,855 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/bin/uautomizer-verify-uCwYo4JHxu/data/81517d599/9b2a3c6a1e824009855bb5f1c252068b/FLAGea6632913 [2023-11-19 07:54:35,873 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/bin/uautomizer-verify-uCwYo4JHxu/data/81517d599/9b2a3c6a1e824009855bb5f1c252068b [2023-11-19 07:54:35,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:54:35,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:54:35,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:54:35,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:54:35,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:54:35,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:35" (1/1) ... [2023-11-19 07:54:35,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44789e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:35, skipping insertion in model container [2023-11-19 07:54:35,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:35" (1/1) ... [2023-11-19 07:54:35,934 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:54:36,117 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_0843e235-d050-4eec-9d07-c20ac7e97149/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i[916,929] [2023-11-19 07:54:36,200 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:54:36,212 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:54:36,231 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_0843e235-d050-4eec-9d07-c20ac7e97149/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i[916,929] [2023-11-19 07:54:36,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:54:36,295 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:54:36,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36 WrapperNode [2023-11-19 07:54:36,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:54:36,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:54:36,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:54:36,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:54:36,303 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:54:36" (1/1) ... [2023-11-19 07:54:36,318 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:54:36" (1/1) ... [2023-11-19 07:54:36,378 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2023-11-19 07:54:36,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:54:36,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:54:36,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:54:36,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:54:36,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:54:36,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:54:36,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:54:36,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:54:36,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (1/1) ... [2023-11-19 07:54:36,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:54:36,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:54:36,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/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:54:36,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0843e235-d050-4eec-9d07-c20ac7e97149/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:54:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:54:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:54:36,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:54:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:54:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:54:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:54:36,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:54:36,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:54:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:54:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:54:36,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:54:36,782 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:54:36,784 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:54:37,349 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:54:37,362 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:54:37,362 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:54:37,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:37 BoogieIcfgContainer [2023-11-19 07:54:37,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:54:37,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:54:37,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:54:37,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:54:37,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:54:35" (1/3) ... [2023-11-19 07:54:37,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f2377f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:37, skipping insertion in model container [2023-11-19 07:54:37,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:36" (2/3) ... [2023-11-19 07:54:37,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f2377f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:37, skipping insertion in model container [2023-11-19 07:54:37,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:37" (3/3) ... [2023-11-19 07:54:37,375 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2023-11-19 07:54:37,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:54:37,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:54:37,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:54:37,445 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;@3595507a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:54:37,445 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:54:37,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-19 07:54:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-19 07:54:37,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:37,465 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:37,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:37,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2041472448, now seen corresponding path program 1 times [2023-11-19 07:54:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746490720] [2023-11-19 07:54:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746490720] [2023-11-19 07:54:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746490720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:37,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:37,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:54:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372807242] [2023-11-19 07:54:38,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:38,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:54:38,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:38,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:54:38,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:54:38,059 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:38,104 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2023-11-19 07:54:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:54:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-11-19 07:54:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:38,115 INFO L225 Difference]: With dead ends: 217 [2023-11-19 07:54:38,115 INFO L226 Difference]: Without dead ends: 108 [2023-11-19 07:54:38,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:54:38,123 INFO L413 NwaCegarLoop]: 155 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, 155 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:54:38,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:54:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-19 07:54:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-19 07:54:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-19 07:54:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2023-11-19 07:54:38,178 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2023-11-19 07:54:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:38,179 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2023-11-19 07:54:38,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2023-11-19 07:54:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-19 07:54:38,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:38,185 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:38,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:54:38,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:38,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1459831392, now seen corresponding path program 1 times [2023-11-19 07:54:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778536126] [2023-11-19 07:54:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:38,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778536126] [2023-11-19 07:54:38,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778536126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:38,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:54:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905783806] [2023-11-19 07:54:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:38,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:54:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:38,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:54:38,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:54:38,617 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:38,694 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2023-11-19 07:54:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:54:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-11-19 07:54:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:38,705 INFO L225 Difference]: With dead ends: 219 [2023-11-19 07:54:38,705 INFO L226 Difference]: Without dead ends: 114 [2023-11-19 07:54:38,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:54:38,708 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 10 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 453 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:54:38,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 453 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:54:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-19 07:54:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2023-11-19 07:54:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-19 07:54:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2023-11-19 07:54:38,742 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 140 [2023-11-19 07:54:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:38,742 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2023-11-19 07:54:38,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2023-11-19 07:54:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-19 07:54:38,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:38,755 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:38,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:54:38,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:38,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1804095006, now seen corresponding path program 1 times [2023-11-19 07:54:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:38,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618749670] [2023-11-19 07:54:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:38,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618749670] [2023-11-19 07:54:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618749670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:39,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:39,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:54:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404156109] [2023-11-19 07:54:39,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:39,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:39,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:39,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:39,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:39,384 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:39,429 INFO L93 Difference]: Finished difference Result 217 states and 311 transitions. [2023-11-19 07:54:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:39,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-11-19 07:54:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:39,439 INFO L225 Difference]: With dead ends: 217 [2023-11-19 07:54:39,439 INFO L226 Difference]: Without dead ends: 110 [2023-11-19 07:54:39,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:54:39,442 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:39,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 302 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:54:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-19 07:54:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-19 07:54:39,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-19 07:54:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2023-11-19 07:54:39,467 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 140 [2023-11-19 07:54:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:39,468 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2023-11-19 07:54:39,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2023-11-19 07:54:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-19 07:54:39,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:39,472 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:39,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:54:39,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:39,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash 783026652, now seen corresponding path program 1 times [2023-11-19 07:54:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382734071] [2023-11-19 07:54:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:40,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382734071] [2023-11-19 07:54:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382734071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:54:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585942990] [2023-11-19 07:54:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:41,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:54:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:41,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:54:41,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:54:41,048 INFO L87 Difference]: Start difference. First operand 110 states and 156 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:41,539 INFO L93 Difference]: Finished difference Result 296 states and 423 transitions. [2023-11-19 07:54:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:54:41,540 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-11-19 07:54:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:41,548 INFO L225 Difference]: With dead ends: 296 [2023-11-19 07:54:41,548 INFO L226 Difference]: Without dead ends: 189 [2023-11-19 07:54:41,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:54:41,561 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 471 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:41,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 359 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:54:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-19 07:54:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 128. [2023-11-19 07:54:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 108 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-19 07:54:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 183 transitions. [2023-11-19 07:54:41,579 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 183 transitions. Word has length 140 [2023-11-19 07:54:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:41,579 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 183 transitions. [2023-11-19 07:54:41,580 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 183 transitions. [2023-11-19 07:54:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-19 07:54:41,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:41,586 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:54:41,586 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:41,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:41,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1484091230, now seen corresponding path program 1 times [2023-11-19 07:54:41,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:41,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352892329] [2023-11-19 07:54:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:44,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352892329] [2023-11-19 07:54:44,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352892329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:44,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:54:44,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472259801] [2023-11-19 07:54:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:44,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:54:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:44,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:54:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:54:44,619 INFO L87 Difference]: Start difference. First operand 128 states and 183 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:45,475 INFO L93 Difference]: Finished difference Result 378 states and 538 transitions. [2023-11-19 07:54:45,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:54:45,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2023-11-19 07:54:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:45,479 INFO L225 Difference]: With dead ends: 378 [2023-11-19 07:54:45,479 INFO L226 Difference]: Without dead ends: 253 [2023-11-19 07:54:45,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:54:45,481 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 232 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:45,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 536 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:54:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-19 07:54:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2023-11-19 07:54:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 202 states have (on average 1.3316831683168318) internal successors, (269), 203 states have internal predecessors, (269), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-19 07:54:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 353 transitions. [2023-11-19 07:54:45,522 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 353 transitions. Word has length 140 [2023-11-19 07:54:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:45,523 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 353 transitions. [2023-11-19 07:54:45,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 353 transitions. [2023-11-19 07:54:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-19 07:54:45,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:45,526 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:45,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:54:45,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:45,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:45,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2082950621, now seen corresponding path program 1 times [2023-11-19 07:54:45,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:45,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378273670] [2023-11-19 07:54:45,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378273670] [2023-11-19 07:54:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378273670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:54:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404075601] [2023-11-19 07:54:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:46,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:54:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:54:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:54:46,683 INFO L87 Difference]: Start difference. First operand 248 states and 353 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:47,047 INFO L93 Difference]: Finished difference Result 401 states and 574 transitions. [2023-11-19 07:54:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:54:47,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2023-11-19 07:54:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:47,052 INFO L225 Difference]: With dead ends: 401 [2023-11-19 07:54:47,052 INFO L226 Difference]: Without dead ends: 276 [2023-11-19 07:54:47,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:54:47,056 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 381 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:47,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 317 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:54:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-19 07:54:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 232. [2023-11-19 07:54:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 186 states have (on average 1.3118279569892473) internal successors, (244), 187 states have internal predecessors, (244), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-19 07:54:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 328 transitions. [2023-11-19 07:54:47,103 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 328 transitions. Word has length 142 [2023-11-19 07:54:47,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:47,105 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 328 transitions. [2023-11-19 07:54:47,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 328 transitions. [2023-11-19 07:54:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-19 07:54:47,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:47,109 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:47,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:54:47,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:47,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:47,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1381886043, now seen corresponding path program 1 times [2023-11-19 07:54:47,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:47,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025797800] [2023-11-19 07:54:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:47,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:50,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025797800] [2023-11-19 07:54:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025797800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:50,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 07:54:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021717738] [2023-11-19 07:54:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:50,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 07:54:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 07:54:50,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:54:50,027 INFO L87 Difference]: Start difference. First operand 232 states and 328 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:51,369 INFO L93 Difference]: Finished difference Result 413 states and 580 transitions. [2023-11-19 07:54:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:54:51,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2023-11-19 07:54:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:51,374 INFO L225 Difference]: With dead ends: 413 [2023-11-19 07:54:51,374 INFO L226 Difference]: Without dead ends: 304 [2023-11-19 07:54:51,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:54:51,376 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 254 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:51,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 723 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 07:54:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-19 07:54:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 283. [2023-11-19 07:54:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 236 states have (on average 1.3347457627118644) internal successors, (315), 237 states have internal predecessors, (315), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-19 07:54:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 399 transitions. [2023-11-19 07:54:51,427 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 399 transitions. Word has length 142 [2023-11-19 07:54:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:51,430 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 399 transitions. [2023-11-19 07:54:51,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 399 transitions. [2023-11-19 07:54:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-19 07:54:51,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:51,434 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:51,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:54:51,435 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:51,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1289492674, now seen corresponding path program 1 times [2023-11-19 07:54:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:51,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389936283] [2023-11-19 07:54:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389936283] [2023-11-19 07:54:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389936283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:51,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:54:51,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959128050] [2023-11-19 07:54:51,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:51,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:51,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:51,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:51,804 INFO L87 Difference]: Start difference. First operand 283 states and 399 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:51,847 INFO L93 Difference]: Finished difference Result 576 states and 813 transitions. [2023-11-19 07:54:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2023-11-19 07:54:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:51,853 INFO L225 Difference]: With dead ends: 576 [2023-11-19 07:54:51,853 INFO L226 Difference]: Without dead ends: 296 [2023-11-19 07:54:51,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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:54:51,856 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 36 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:51,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 282 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:54:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-19 07:54:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 283. [2023-11-19 07:54:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 236 states have (on average 1.3220338983050848) internal successors, (312), 237 states have internal predecessors, (312), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-19 07:54:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 396 transitions. [2023-11-19 07:54:51,897 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 396 transitions. Word has length 145 [2023-11-19 07:54:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:51,898 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 396 transitions. [2023-11-19 07:54:51,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 396 transitions. [2023-11-19 07:54:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-19 07:54:51,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:51,900 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:51,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:54:51,902 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:51,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash 702686660, now seen corresponding path program 1 times [2023-11-19 07:54:51,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:51,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779394618] [2023-11-19 07:54:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:52,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779394618] [2023-11-19 07:54:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779394618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:54:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46488075] [2023-11-19 07:54:52,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:52,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:54:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:52,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:54:52,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:52,671 INFO L87 Difference]: Start difference. First operand 283 states and 396 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:52,981 INFO L93 Difference]: Finished difference Result 738 states and 1019 transitions. [2023-11-19 07:54:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:54:52,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2023-11-19 07:54:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:52,987 INFO L225 Difference]: With dead ends: 738 [2023-11-19 07:54:52,987 INFO L226 Difference]: Without dead ends: 458 [2023-11-19 07:54:52,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:54:52,991 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 136 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:52,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 715 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:54:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-11-19 07:54:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 420. [2023-11-19 07:54:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 364 states have (on average 1.3131868131868132) internal successors, (478), 368 states have internal predecessors, (478), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:54:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 574 transitions. [2023-11-19 07:54:53,051 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 574 transitions. Word has length 145 [2023-11-19 07:54:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:53,052 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 574 transitions. [2023-11-19 07:54:53,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 574 transitions. [2023-11-19 07:54:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-19 07:54:53,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:53,055 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:54:53,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:53,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1030740188, now seen corresponding path program 1 times [2023-11-19 07:54:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424325984] [2023-11-19 07:54:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:54,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424325984] [2023-11-19 07:54:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424325984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:54,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 07:54:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457901878] [2023-11-19 07:54:54,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:54,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 07:54:54,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 07:54:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:54:54,784 INFO L87 Difference]: Start difference. First operand 420 states and 574 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:56,160 INFO L93 Difference]: Finished difference Result 976 states and 1333 transitions. [2023-11-19 07:54:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:54:56,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2023-11-19 07:54:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:56,166 INFO L225 Difference]: With dead ends: 976 [2023-11-19 07:54:56,166 INFO L226 Difference]: Without dead ends: 559 [2023-11-19 07:54:56,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:54:56,168 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 350 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:56,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 768 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 07:54:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-11-19 07:54:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 434. [2023-11-19 07:54:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 378 states have (on average 1.3174603174603174) internal successors, (498), 382 states have internal predecessors, (498), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:54:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 594 transitions. [2023-11-19 07:54:56,219 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 594 transitions. Word has length 146 [2023-11-19 07:54:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:56,220 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 594 transitions. [2023-11-19 07:54:56,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:54:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 594 transitions. [2023-11-19 07:54:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-19 07:54:56,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:56,223 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:56,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:54:56,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:56,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1731804766, now seen corresponding path program 1 times [2023-11-19 07:54:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:56,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273052266] [2023-11-19 07:54:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:56,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273052266] [2023-11-19 07:54:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273052266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:56,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060873113] [2023-11-19 07:54:56,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:56,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:54:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:54:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:54:56,706 INFO L87 Difference]: Start difference. First operand 434 states and 594 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:57,098 INFO L93 Difference]: Finished difference Result 1146 states and 1577 transitions. [2023-11-19 07:54:57,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:54:57,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-11-19 07:54:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:57,105 INFO L225 Difference]: With dead ends: 1146 [2023-11-19 07:54:57,105 INFO L226 Difference]: Without dead ends: 715 [2023-11-19 07:54:57,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:54:57,108 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 103 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:57,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 543 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:54:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-11-19 07:54:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 463. [2023-11-19 07:54:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 407 states have (on average 1.3144963144963144) internal successors, (535), 411 states have internal predecessors, (535), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:54:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 631 transitions. [2023-11-19 07:54:57,176 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 631 transitions. Word has length 146 [2023-11-19 07:54:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:57,176 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 631 transitions. [2023-11-19 07:54:57,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 631 transitions. [2023-11-19 07:54:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-19 07:54:57,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:57,180 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:57,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:54:57,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:57,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 213091738, now seen corresponding path program 1 times [2023-11-19 07:54:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513966672] [2023-11-19 07:54:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:54:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:54:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:54:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:54:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:54:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:54:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:54:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:54:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:54:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:54:57,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513966672] [2023-11-19 07:54:57,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513966672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:57,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:57,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886661451] [2023-11-19 07:54:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:57,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:54:57,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:57,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:54:57,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:54:57,660 INFO L87 Difference]: Start difference. First operand 463 states and 631 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:58,065 INFO L93 Difference]: Finished difference Result 1198 states and 1640 transitions. [2023-11-19 07:54:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:54:58,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2023-11-19 07:54:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:58,072 INFO L225 Difference]: With dead ends: 1198 [2023-11-19 07:54:58,072 INFO L226 Difference]: Without dead ends: 738 [2023-11-19 07:54:58,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:54:58,074 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 111 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:58,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 596 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:54:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2023-11-19 07:54:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 486. [2023-11-19 07:54:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 430 states have (on average 1.302325581395349) internal successors, (560), 434 states have internal predecessors, (560), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:54:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 656 transitions. [2023-11-19 07:54:58,133 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 656 transitions. Word has length 146 [2023-11-19 07:54:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:58,134 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 656 transitions. [2023-11-19 07:54:58,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:54:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 656 transitions. [2023-11-19 07:54:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-19 07:54:58,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:58,137 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:58,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:54:58,138 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:58,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 914156316, now seen corresponding path program 1 times [2023-11-19 07:54:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768480889] [2023-11-19 07:54:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:55:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:55:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:55:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:55:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:55:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:55:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:55:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768480889] [2023-11-19 07:55:00,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768480889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:00,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:00,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-19 07:55:00,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247469946] [2023-11-19 07:55:00,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:00,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:55:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:00,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:55:00,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:55:00,806 INFO L87 Difference]: Start difference. First operand 486 states and 656 transitions. Second operand has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-19 07:55:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:02,944 INFO L93 Difference]: Finished difference Result 1118 states and 1507 transitions. [2023-11-19 07:55:02,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:55:02,945 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2023-11-19 07:55:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:02,949 INFO L225 Difference]: With dead ends: 1118 [2023-11-19 07:55:02,950 INFO L226 Difference]: Without dead ends: 635 [2023-11-19 07:55:02,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-11-19 07:55:02,952 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 308 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:02,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1009 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-19 07:55:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-11-19 07:55:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 493. [2023-11-19 07:55:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 437 states have (on average 1.299771167048055) internal successors, (568), 441 states have internal predecessors, (568), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:55:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 664 transitions. [2023-11-19 07:55:03,012 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 664 transitions. Word has length 146 [2023-11-19 07:55:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:03,013 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 664 transitions. [2023-11-19 07:55:03,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-19 07:55:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 664 transitions. [2023-11-19 07:55:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-19 07:55:03,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:03,016 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:55:03,017 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:03,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash -521876192, now seen corresponding path program 1 times [2023-11-19 07:55:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765727801] [2023-11-19 07:55:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:55:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:55:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:55:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:55:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:55:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:55:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:55:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765727801] [2023-11-19 07:55:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765727801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:03,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:55:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070623941] [2023-11-19 07:55:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:03,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:55:03,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:55:03,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:55:03,396 INFO L87 Difference]: Start difference. First operand 493 states and 664 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:55:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:03,498 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2023-11-19 07:55:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:55:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-11-19 07:55:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:03,504 INFO L225 Difference]: With dead ends: 1073 [2023-11-19 07:55:03,504 INFO L226 Difference]: Without dead ends: 583 [2023-11-19 07:55:03,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:55:03,508 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 74 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:03,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 736 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2023-11-19 07:55:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 508. [2023-11-19 07:55:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 452 states have (on average 1.2898230088495575) internal successors, (583), 456 states have internal predecessors, (583), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:55:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 679 transitions. [2023-11-19 07:55:03,558 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 679 transitions. Word has length 147 [2023-11-19 07:55:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:03,559 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 679 transitions. [2023-11-19 07:55:03,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:55:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 679 transitions. [2023-11-19 07:55:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-19 07:55:03,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:03,563 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:03,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:55:03,564 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:03,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1583211690, now seen corresponding path program 1 times [2023-11-19 07:55:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993110718] [2023-11-19 07:55:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:03,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:55:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:55:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:55:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:55:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:55:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:55:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:55:03,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:03,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993110718] [2023-11-19 07:55:03,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993110718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:03,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:03,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:55:03,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659017044] [2023-11-19 07:55:03,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:03,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:55:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:03,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:55:03,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:55:03,859 INFO L87 Difference]: Start difference. First operand 508 states and 679 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:55:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:03,953 INFO L93 Difference]: Finished difference Result 1061 states and 1421 transitions. [2023-11-19 07:55:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:55:03,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-11-19 07:55:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:03,961 INFO L225 Difference]: With dead ends: 1061 [2023-11-19 07:55:03,961 INFO L226 Difference]: Without dead ends: 556 [2023-11-19 07:55:03,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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:55:03,966 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 32 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:03,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 579 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-11-19 07:55:04,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 526. [2023-11-19 07:55:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 470 states have (on average 1.278723404255319) internal successors, (601), 474 states have internal predecessors, (601), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:55:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 697 transitions. [2023-11-19 07:55:04,020 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 697 transitions. Word has length 147 [2023-11-19 07:55:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:04,020 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 697 transitions. [2023-11-19 07:55:04,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-19 07:55:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 697 transitions. [2023-11-19 07:55:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-19 07:55:04,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:04,024 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:04,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:55:04,024 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:04,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:04,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1000804381, now seen corresponding path program 1 times [2023-11-19 07:55:04,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:04,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375485322] [2023-11-19 07:55:04,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:04,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:55:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:55:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:06,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:55:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:06,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:55:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:06,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:55:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:06,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:55:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:55:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375485322] [2023-11-19 07:55:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375485322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-19 07:55:06,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564558506] [2023-11-19 07:55:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:06,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:55:06,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:06,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:55:06,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:55:06,024 INFO L87 Difference]: Start difference. First operand 526 states and 697 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:55:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:08,375 INFO L93 Difference]: Finished difference Result 1016 states and 1339 transitions. [2023-11-19 07:55:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:55:08,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2023-11-19 07:55:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:08,381 INFO L225 Difference]: With dead ends: 1016 [2023-11-19 07:55:08,381 INFO L226 Difference]: Without dead ends: 691 [2023-11-19 07:55:08,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2023-11-19 07:55:08,384 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 306 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:08,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1372 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-19 07:55:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2023-11-19 07:55:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 527. [2023-11-19 07:55:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 471 states have (on average 1.2781316348195328) internal successors, (602), 475 states have internal predecessors, (602), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:55:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 698 transitions. [2023-11-19 07:55:08,433 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 698 transitions. Word has length 148 [2023-11-19 07:55:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:08,433 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 698 transitions. [2023-11-19 07:55:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 07:55:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 698 transitions. [2023-11-19 07:55:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-19 07:55:08,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:08,436 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:08,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:55:08,437 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:08,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1117388253, now seen corresponding path program 1 times [2023-11-19 07:55:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:08,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496761762] [2023-11-19 07:55:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:55:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-19 07:55:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-19 07:55:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-19 07:55:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-19 07:55:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 07:55:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-19 07:55:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496761762] [2023-11-19 07:55:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496761762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:11,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-19 07:55:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613375819] [2023-11-19 07:55:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:11,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 07:55:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:11,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 07:55:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:55:11,757 INFO L87 Difference]: Start difference. First operand 527 states and 698 transitions. Second operand has 16 states, 14 states have (on average 4.357142857142857) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18)