./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl --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 9e676a9bb9259ddb9063c9a4fa6515c5445e4b4dd1533585e7d2db7e7d77e030 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:20:02,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:20:02,370 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:20:02,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:20:02,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:20:02,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:20:02,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:20:02,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:20:02,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:20:02,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:20:02,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:20:02,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:20:02,434 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:20:02,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:20:02,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:20:02,437 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:20:02,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:20:02,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:20:02,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:20:02,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:20:02,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:20:02,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:20:02,440 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:20:02,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:20:02,441 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:20:02,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:20:02,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:20:02,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:20:02,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:20:02,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:20:02,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:20:02,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:20:02,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:20:02,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:20:02,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:20:02,447 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:20:02,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:20:02,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:20:02,448 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:20:02,448 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_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/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_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl 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 -> 9e676a9bb9259ddb9063c9a4fa6515c5445e4b4dd1533585e7d2db7e7d77e030 [2023-11-12 02:20:02,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:20:02,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:20:02,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:20:02,821 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:20:02,821 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:20:02,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i [2023-11-12 02:20:05,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:20:06,075 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:20:06,076 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i [2023-11-12 02:20:06,086 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/data/93f5981c0/d146431981ff42eb85f29933cb982132/FLAG6d77184bf [2023-11-12 02:20:06,119 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/data/93f5981c0/d146431981ff42eb85f29933cb982132 [2023-11-12 02:20:06,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:20:06,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:20:06,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:20:06,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:20:06,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:20:06,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233ff27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06, skipping insertion in model container [2023-11-12 02:20:06,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,171 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:20:06,329 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_277513aa-d51b-48f3-b197-58afc1ec0536/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i[916,929] [2023-11-12 02:20:06,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:20:06,404 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:20:06,417 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_277513aa-d51b-48f3-b197-58afc1ec0536/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i[916,929] [2023-11-12 02:20:06,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:20:06,490 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:20:06,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06 WrapperNode [2023-11-12 02:20:06,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:20:06,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:20:06,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:20:06,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:20:06,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,566 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2023-11-12 02:20:06,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:20:06,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:20:06,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:20:06,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:20:06,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:20:06,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:20:06,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:20:06,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:20:06,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (1/1) ... [2023-11-12 02:20:06,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:20:06,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:20:06,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:20:06,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_277513aa-d51b-48f3-b197-58afc1ec0536/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:20:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:20:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:20:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:20:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:20:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:20:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:20:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:20:06,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:20:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:20:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:20:06,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:20:06,951 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:20:06,953 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:20:07,467 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:20:07,475 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:20:07,475 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:20:07,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:20:07 BoogieIcfgContainer [2023-11-12 02:20:07,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:20:07,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:20:07,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:20:07,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:20:07,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:20:06" (1/3) ... [2023-11-12 02:20:07,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b89d7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:20:07, skipping insertion in model container [2023-11-12 02:20:07,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:06" (2/3) ... [2023-11-12 02:20:07,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b89d7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:20:07, skipping insertion in model container [2023-11-12 02:20:07,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:20:07" (3/3) ... [2023-11-12 02:20:07,486 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-15.i [2023-11-12 02:20:07,504 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:20:07,504 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:20:07,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:20:07,566 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;@5e9a2fb2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:20:07,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:20:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:20:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-12 02:20:07,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:07,587 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:07,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:07,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2035840874, now seen corresponding path program 1 times [2023-11-12 02:20:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778946108] [2023-11-12 02:20:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:07,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:07,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:07,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:08,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778946108] [2023-11-12 02:20:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778946108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:20:08,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700451440] [2023-11-12 02:20:08,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:08,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:20:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:08,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:20:08,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:20:08,097 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:08,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:08,158 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2023-11-12 02:20:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:20:08,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-11-12 02:20:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:08,172 INFO L225 Difference]: With dead ends: 219 [2023-11-12 02:20:08,173 INFO L226 Difference]: Without dead ends: 109 [2023-11-12 02:20:08,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-12 02:20:08,183 INFO L413 NwaCegarLoop]: 157 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, 157 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-12 02:20:08,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:20:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-12 02:20:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-12 02:20:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:20:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-11-12 02:20:08,254 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2023-11-12 02:20:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:08,256 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-11-12 02:20:08,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-11-12 02:20:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-12 02:20:08,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:08,266 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:08,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:20:08,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:08,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1301520678, now seen corresponding path program 1 times [2023-11-12 02:20:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816789916] [2023-11-12 02:20:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:08,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816789916] [2023-11-12 02:20:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816789916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:20:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129262204] [2023-11-12 02:20:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:08,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:20:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:08,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:20:08,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:20:08,813 INFO L87 Difference]: Start difference. First operand 109 states and 157 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:08,842 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2023-11-12 02:20:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:20:08,846 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-12 02:20:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:08,849 INFO L225 Difference]: With dead ends: 213 [2023-11-12 02:20:08,849 INFO L226 Difference]: Without dead ends: 107 [2023-11-12 02:20:08,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-12 02:20:08,852 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 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-12 02:20:08,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:20:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-12 02:20:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-12 02:20:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:20:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2023-11-12 02:20:08,865 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 115 [2023-11-12 02:20:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:08,867 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2023-11-12 02:20:08,868 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2023-11-12 02:20:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-12 02:20:08,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:08,870 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:08,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:20:08,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:08,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1429684445, now seen corresponding path program 1 times [2023-11-12 02:20:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038096040] [2023-11-12 02:20:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:09,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038096040] [2023-11-12 02:20:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038096040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:09,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:09,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:20:09,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765768835] [2023-11-12 02:20:09,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:09,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:20:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:20:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:20:09,074 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:09,133 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2023-11-12 02:20:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:20:09,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-11-12 02:20:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:09,136 INFO L225 Difference]: With dead ends: 217 [2023-11-12 02:20:09,136 INFO L226 Difference]: Without dead ends: 113 [2023-11-12 02:20:09,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-12 02:20:09,139 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 10 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 447 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-12 02:20:09,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 447 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:20:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-12 02:20:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2023-11-12 02:20:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:20:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2023-11-12 02:20:09,155 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 115 [2023-11-12 02:20:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:09,156 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2023-11-12 02:20:09,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2023-11-12 02:20:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-12 02:20:09,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:09,162 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:09,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:20:09,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:09,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 619703397, now seen corresponding path program 1 times [2023-11-12 02:20:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613246959] [2023-11-12 02:20:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:09,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613246959] [2023-11-12 02:20:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613246959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:20:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724786450] [2023-11-12 02:20:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:09,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:20:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:20:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:20:09,440 INFO L87 Difference]: Start difference. First operand 109 states and 155 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:09,474 INFO L93 Difference]: Finished difference Result 239 states and 342 transitions. [2023-11-12 02:20:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:20:09,477 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-12 02:20:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:09,490 INFO L225 Difference]: With dead ends: 239 [2023-11-12 02:20:09,490 INFO L226 Difference]: Without dead ends: 133 [2023-11-12 02:20:09,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-12 02:20:09,493 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:09,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:20:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-12 02:20:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2023-11-12 02:20:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 02:20:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2023-11-12 02:20:09,516 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 115 [2023-11-12 02:20:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:09,517 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2023-11-12 02:20:09,517 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2023-11-12 02:20:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-12 02:20:09,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:09,519 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:09,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:20:09,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:09,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash 877868835, now seen corresponding path program 1 times [2023-11-12 02:20:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956903767] [2023-11-12 02:20:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:10,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:10,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:11,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:11,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:11,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:11,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956903767] [2023-11-12 02:20:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956903767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:11,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:20:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993357104] [2023-11-12 02:20:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:11,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:20:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:11,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:20:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:20:11,045 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:11,419 INFO L93 Difference]: Finished difference Result 325 states and 464 transitions. [2023-11-12 02:20:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:20:11,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-12 02:20:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:11,422 INFO L225 Difference]: With dead ends: 325 [2023-11-12 02:20:11,422 INFO L226 Difference]: Without dead ends: 218 [2023-11-12 02:20:11,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:11,425 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 105 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:11,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 309 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:20:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-12 02:20:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2023-11-12 02:20:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 187 states have (on average 1.374331550802139) internal successors, (257), 187 states have internal predecessors, (257), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 02:20:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 305 transitions. [2023-11-12 02:20:11,448 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 305 transitions. Word has length 115 [2023-11-12 02:20:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:11,449 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 305 transitions. [2023-11-12 02:20:11,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 305 transitions. [2023-11-12 02:20:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:20:11,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:11,451 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:11,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:20:11,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:11,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash -586503741, now seen corresponding path program 1 times [2023-11-12 02:20:11,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:11,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108135443] [2023-11-12 02:20:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:12,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:12,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108135443] [2023-11-12 02:20:12,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108135443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:12,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:12,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:20:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973421161] [2023-11-12 02:20:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:12,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:20:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:20:12,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:20:12,925 INFO L87 Difference]: Start difference. First operand 214 states and 305 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:13,329 INFO L93 Difference]: Finished difference Result 452 states and 644 transitions. [2023-11-12 02:20:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:20:13,330 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-12 02:20:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:13,333 INFO L225 Difference]: With dead ends: 452 [2023-11-12 02:20:13,334 INFO L226 Difference]: Without dead ends: 241 [2023-11-12 02:20:13,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:13,340 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 262 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:13,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 308 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:20:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-12 02:20:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 213. [2023-11-12 02:20:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.3709677419354838) internal successors, (255), 186 states have internal predecessors, (255), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 02:20:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 303 transitions. [2023-11-12 02:20:13,383 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 303 transitions. Word has length 116 [2023-11-12 02:20:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:13,384 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 303 transitions. [2023-11-12 02:20:13,384 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 303 transitions. [2023-11-12 02:20:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:20:13,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:13,387 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:13,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:20:13,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:13,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1699703966, now seen corresponding path program 1 times [2023-11-12 02:20:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:13,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793941221] [2023-11-12 02:20:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793941221] [2023-11-12 02:20:13,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793941221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:13,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:13,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:20:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239708720] [2023-11-12 02:20:13,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:13,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:20:13,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:13,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:20:13,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:20:13,856 INFO L87 Difference]: Start difference. First operand 213 states and 303 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:14,158 INFO L93 Difference]: Finished difference Result 449 states and 631 transitions. [2023-11-12 02:20:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:20:14,159 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-12 02:20:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:14,162 INFO L225 Difference]: With dead ends: 449 [2023-11-12 02:20:14,162 INFO L226 Difference]: Without dead ends: 341 [2023-11-12 02:20:14,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:20:14,167 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 118 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:14,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 623 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:20:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-12 02:20:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 316. [2023-11-12 02:20:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 279 states have (on average 1.3584229390681004) internal successors, (379), 281 states have internal predecessors, (379), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:20:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 443 transitions. [2023-11-12 02:20:14,202 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 443 transitions. Word has length 117 [2023-11-12 02:20:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:14,204 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 443 transitions. [2023-11-12 02:20:14,205 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 443 transitions. [2023-11-12 02:20:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:20:14,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:14,208 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:14,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:20:14,208 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:14,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -879418456, now seen corresponding path program 1 times [2023-11-12 02:20:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386052615] [2023-11-12 02:20:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:15,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386052615] [2023-11-12 02:20:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386052615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:20:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337484604] [2023-11-12 02:20:15,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:15,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:20:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:20:15,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:20:15,080 INFO L87 Difference]: Start difference. First operand 316 states and 443 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:15,612 INFO L93 Difference]: Finished difference Result 680 states and 956 transitions. [2023-11-12 02:20:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:20:15,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-11-12 02:20:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:15,619 INFO L225 Difference]: With dead ends: 680 [2023-11-12 02:20:15,619 INFO L226 Difference]: Without dead ends: 519 [2023-11-12 02:20:15,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:20:15,621 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 241 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:15,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 463 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:20:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-11-12 02:20:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 469. [2023-11-12 02:20:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 414 states have (on average 1.3599033816425121) internal successors, (563), 417 states have internal predecessors, (563), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-12 02:20:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 659 transitions. [2023-11-12 02:20:15,658 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 659 transitions. Word has length 118 [2023-11-12 02:20:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:15,659 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 659 transitions. [2023-11-12 02:20:15,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 659 transitions. [2023-11-12 02:20:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:20:15,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:15,661 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:15,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:20:15,662 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:15,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash -61770006, now seen corresponding path program 1 times [2023-11-12 02:20:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087515958] [2023-11-12 02:20:15,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:16,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:16,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087515958] [2023-11-12 02:20:16,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087515958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:16,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:16,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:20:16,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077768972] [2023-11-12 02:20:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:16,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:20:16,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:16,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:20:16,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:16,830 INFO L87 Difference]: Start difference. First operand 469 states and 659 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:17,187 INFO L93 Difference]: Finished difference Result 1046 states and 1469 transitions. [2023-11-12 02:20:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:20:17,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2023-11-12 02:20:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:17,195 INFO L225 Difference]: With dead ends: 1046 [2023-11-12 02:20:17,195 INFO L226 Difference]: Without dead ends: 732 [2023-11-12 02:20:17,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 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-12 02:20:17,198 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 126 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:17,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 403 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:20:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2023-11-12 02:20:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 475. [2023-11-12 02:20:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 420 states have (on average 1.3547619047619048) internal successors, (569), 423 states have internal predecessors, (569), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-12 02:20:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 665 transitions. [2023-11-12 02:20:17,253 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 665 transitions. Word has length 118 [2023-11-12 02:20:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:17,253 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 665 transitions. [2023-11-12 02:20:17,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 665 transitions. [2023-11-12 02:20:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:20:17,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:17,256 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:17,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:20:17,257 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:17,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash 399872471, now seen corresponding path program 1 times [2023-11-12 02:20:17,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:17,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676451733] [2023-11-12 02:20:17,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:17,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:17,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:17,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676451733] [2023-11-12 02:20:17,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676451733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:17,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:17,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:20:17,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41003907] [2023-11-12 02:20:17,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:17,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:20:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:20:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:17,643 INFO L87 Difference]: Start difference. First operand 475 states and 665 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:18,145 INFO L93 Difference]: Finished difference Result 1338 states and 1883 transitions. [2023-11-12 02:20:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:20:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-11-12 02:20:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:18,152 INFO L225 Difference]: With dead ends: 1338 [2023-11-12 02:20:18,152 INFO L226 Difference]: Without dead ends: 866 [2023-11-12 02:20:18,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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-12 02:20:18,155 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 210 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:18,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 820 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:20:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2023-11-12 02:20:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 801. [2023-11-12 02:20:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 707 states have (on average 1.3564356435643565) internal successors, (959), 710 states have internal predecessors, (959), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1127 transitions. [2023-11-12 02:20:18,219 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1127 transitions. Word has length 118 [2023-11-12 02:20:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:18,219 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1127 transitions. [2023-11-12 02:20:18,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1127 transitions. [2023-11-12 02:20:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:20:18,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:18,223 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:18,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:20:18,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:18,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash -484650187, now seen corresponding path program 1 times [2023-11-12 02:20:18,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:18,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282541745] [2023-11-12 02:20:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282541745] [2023-11-12 02:20:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282541745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:19,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:20:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376859972] [2023-11-12 02:20:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:19,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:20:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:20:19,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:19,634 INFO L87 Difference]: Start difference. First operand 801 states and 1127 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:20,090 INFO L93 Difference]: Finished difference Result 2068 states and 2905 transitions. [2023-11-12 02:20:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:20:20,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2023-11-12 02:20:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:20,099 INFO L225 Difference]: With dead ends: 2068 [2023-11-12 02:20:20,099 INFO L226 Difference]: Without dead ends: 1270 [2023-11-12 02:20:20,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:20:20,102 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 95 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:20,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 591 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:20:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2023-11-12 02:20:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 889. [2023-11-12 02:20:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 795 states have (on average 1.3559748427672955) internal successors, (1078), 798 states have internal predecessors, (1078), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1246 transitions. [2023-11-12 02:20:20,175 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1246 transitions. Word has length 118 [2023-11-12 02:20:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:20,176 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1246 transitions. [2023-11-12 02:20:20,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1246 transitions. [2023-11-12 02:20:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:20:20,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:20,178 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:20,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:20:20,179 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:20,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1723454366, now seen corresponding path program 1 times [2023-11-12 02:20:20,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:20,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265448063] [2023-11-12 02:20:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:20,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:21,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265448063] [2023-11-12 02:20:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265448063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:21,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:20:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625014424] [2023-11-12 02:20:21,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:21,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:20:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:21,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:20:21,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:20:21,327 INFO L87 Difference]: Start difference. First operand 889 states and 1246 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:22,310 INFO L93 Difference]: Finished difference Result 1896 states and 2654 transitions. [2023-11-12 02:20:22,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:20:22,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-12 02:20:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:22,317 INFO L225 Difference]: With dead ends: 1896 [2023-11-12 02:20:22,318 INFO L226 Difference]: Without dead ends: 1010 [2023-11-12 02:20:22,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:20:22,320 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 360 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:22,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 609 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 02:20:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2023-11-12 02:20:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 896. [2023-11-12 02:20:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 802 states have (on average 1.3541147132169575) internal successors, (1086), 805 states have internal predecessors, (1086), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1254 transitions. [2023-11-12 02:20:22,398 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1254 transitions. Word has length 119 [2023-11-12 02:20:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:22,399 INFO L495 AbstractCegarLoop]: Abstraction has 896 states and 1254 transitions. [2023-11-12 02:20:22,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1254 transitions. [2023-11-12 02:20:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:20:22,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:22,402 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:22,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:20:22,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:22,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2062039840, now seen corresponding path program 1 times [2023-11-12 02:20:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:22,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143209692] [2023-11-12 02:20:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143209692] [2023-11-12 02:20:24,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143209692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:24,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:24,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:20:24,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257546375] [2023-11-12 02:20:24,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:24,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:20:24,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:24,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:20:24,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:20:24,269 INFO L87 Difference]: Start difference. First operand 896 states and 1254 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:27,265 INFO L93 Difference]: Finished difference Result 2351 states and 3295 transitions. [2023-11-12 02:20:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-12 02:20:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-12 02:20:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:27,278 INFO L225 Difference]: With dead ends: 2351 [2023-11-12 02:20:27,279 INFO L226 Difference]: Without dead ends: 1458 [2023-11-12 02:20:27,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2023-11-12 02:20:27,285 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 594 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:27,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1398 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-12 02:20:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2023-11-12 02:20:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 908. [2023-11-12 02:20:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 814 states have (on average 1.3513513513513513) internal successors, (1100), 817 states have internal predecessors, (1100), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1268 transitions. [2023-11-12 02:20:27,381 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1268 transitions. Word has length 119 [2023-11-12 02:20:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:27,381 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1268 transitions. [2023-11-12 02:20:27,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1268 transitions. [2023-11-12 02:20:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:20:27,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:27,384 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:27,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:20:27,385 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:27,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:27,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1802160377, now seen corresponding path program 1 times [2023-11-12 02:20:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:27,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594058205] [2023-11-12 02:20:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594058205] [2023-11-12 02:20:28,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594058205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:28,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:20:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000654055] [2023-11-12 02:20:28,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:28,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:20:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:20:28,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:28,564 INFO L87 Difference]: Start difference. First operand 908 states and 1268 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:28,980 INFO L93 Difference]: Finished difference Result 2116 states and 2946 transitions. [2023-11-12 02:20:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:20:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-11-12 02:20:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:28,989 INFO L225 Difference]: With dead ends: 2116 [2023-11-12 02:20:28,989 INFO L226 Difference]: Without dead ends: 1211 [2023-11-12 02:20:28,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:20:28,992 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 61 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:28,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 531 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:20:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2023-11-12 02:20:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 904. [2023-11-12 02:20:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 810 states have (on average 1.3407407407407408) internal successors, (1086), 813 states have internal predecessors, (1086), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1254 transitions. [2023-11-12 02:20:29,069 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1254 transitions. Word has length 119 [2023-11-12 02:20:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:29,070 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 1254 transitions. [2023-11-12 02:20:29,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1254 transitions. [2023-11-12 02:20:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:20:29,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:29,072 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:29,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:20:29,073 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:29,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash -142399755, now seen corresponding path program 1 times [2023-11-12 02:20:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715483547] [2023-11-12 02:20:29,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:29,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:29,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715483547] [2023-11-12 02:20:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715483547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:29,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:20:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95214290] [2023-11-12 02:20:29,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:29,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:20:29,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:29,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:20:29,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:20:29,411 INFO L87 Difference]: Start difference. First operand 904 states and 1254 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:29,694 INFO L93 Difference]: Finished difference Result 1772 states and 2458 transitions. [2023-11-12 02:20:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:20:29,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-12 02:20:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:29,700 INFO L225 Difference]: With dead ends: 1772 [2023-11-12 02:20:29,701 INFO L226 Difference]: Without dead ends: 859 [2023-11-12 02:20:29,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:29,706 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 59 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:29,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 388 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:20:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-11-12 02:20:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 806. [2023-11-12 02:20:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 712 states have (on average 1.3328651685393258) internal successors, (949), 715 states have internal predecessors, (949), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1117 transitions. [2023-11-12 02:20:29,777 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1117 transitions. Word has length 119 [2023-11-12 02:20:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:29,778 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1117 transitions. [2023-11-12 02:20:29,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1117 transitions. [2023-11-12 02:20:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-12 02:20:29,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:29,781 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:29,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:20:29,781 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:29,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash 53160668, now seen corresponding path program 1 times [2023-11-12 02:20:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:29,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119706793] [2023-11-12 02:20:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:31,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119706793] [2023-11-12 02:20:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119706793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:31,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:20:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150661195] [2023-11-12 02:20:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:31,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:20:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:31,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:20:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:20:31,124 INFO L87 Difference]: Start difference. First operand 806 states and 1117 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:32,040 INFO L93 Difference]: Finished difference Result 1719 states and 2379 transitions. [2023-11-12 02:20:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:20:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-12 02:20:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:32,047 INFO L225 Difference]: With dead ends: 1719 [2023-11-12 02:20:32,047 INFO L226 Difference]: Without dead ends: 916 [2023-11-12 02:20:32,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:20:32,050 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 250 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:32,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 573 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 02:20:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2023-11-12 02:20:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 814. [2023-11-12 02:20:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 720 states have (on average 1.3319444444444444) internal successors, (959), 723 states have internal predecessors, (959), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1127 transitions. [2023-11-12 02:20:32,128 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1127 transitions. Word has length 120 [2023-11-12 02:20:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:32,128 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1127 transitions. [2023-11-12 02:20:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1127 transitions. [2023-11-12 02:20:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-12 02:20:32,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:32,131 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:32,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:20:32,131 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:32,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1439364062, now seen corresponding path program 1 times [2023-11-12 02:20:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335720262] [2023-11-12 02:20:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335720262] [2023-11-12 02:20:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335720262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:20:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430304908] [2023-11-12 02:20:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:33,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:20:33,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:20:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:33,143 INFO L87 Difference]: Start difference. First operand 814 states and 1127 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:33,561 INFO L93 Difference]: Finished difference Result 1682 states and 2329 transitions. [2023-11-12 02:20:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:20:33,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2023-11-12 02:20:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:33,568 INFO L225 Difference]: With dead ends: 1682 [2023-11-12 02:20:33,568 INFO L226 Difference]: Without dead ends: 871 [2023-11-12 02:20:33,570 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-12 02:20:33,571 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 84 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:33,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 483 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:20:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-11-12 02:20:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 814. [2023-11-12 02:20:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 720 states have (on average 1.3194444444444444) internal successors, (950), 723 states have internal predecessors, (950), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1118 transitions. [2023-11-12 02:20:33,645 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1118 transitions. Word has length 120 [2023-11-12 02:20:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:33,646 INFO L495 AbstractCegarLoop]: Abstraction has 814 states and 1118 transitions. [2023-11-12 02:20:33,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1118 transitions. [2023-11-12 02:20:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-12 02:20:33,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:33,649 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:33,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 02:20:33,650 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:33,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash 418295708, now seen corresponding path program 1 times [2023-11-12 02:20:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122448168] [2023-11-12 02:20:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122448168] [2023-11-12 02:20:35,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122448168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:35,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:35,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:20:35,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514180407] [2023-11-12 02:20:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:35,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:20:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:35,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:20:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:20:35,463 INFO L87 Difference]: Start difference. First operand 814 states and 1118 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:38,259 INFO L93 Difference]: Finished difference Result 1921 states and 2647 transitions. [2023-11-12 02:20:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 02:20:38,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-12 02:20:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:38,266 INFO L225 Difference]: With dead ends: 1921 [2023-11-12 02:20:38,267 INFO L226 Difference]: Without dead ends: 1110 [2023-11-12 02:20:38,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2023-11-12 02:20:38,269 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 489 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:38,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1094 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-12 02:20:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-11-12 02:20:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 806. [2023-11-12 02:20:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 712 states have (on average 1.3202247191011236) internal successors, (940), 715 states have internal predecessors, (940), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1108 transitions. [2023-11-12 02:20:38,345 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1108 transitions. Word has length 120 [2023-11-12 02:20:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:38,345 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1108 transitions. [2023-11-12 02:20:38,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1108 transitions. [2023-11-12 02:20:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-12 02:20:38,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:38,348 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:38,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 02:20:38,348 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:38,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1352900189, now seen corresponding path program 1 times [2023-11-12 02:20:38,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:38,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704003049] [2023-11-12 02:20:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:38,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:38,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704003049] [2023-11-12 02:20:38,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704003049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:38,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:38,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:20:38,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855762058] [2023-11-12 02:20:38,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:38,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:20:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:38,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:20:38,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:20:38,711 INFO L87 Difference]: Start difference. First operand 806 states and 1108 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:39,235 INFO L93 Difference]: Finished difference Result 1833 states and 2525 transitions. [2023-11-12 02:20:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 02:20:39,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-12 02:20:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:39,242 INFO L225 Difference]: With dead ends: 1833 [2023-11-12 02:20:39,243 INFO L226 Difference]: Without dead ends: 1030 [2023-11-12 02:20:39,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:20:39,246 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 301 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:39,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1013 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:20:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2023-11-12 02:20:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 825. [2023-11-12 02:20:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 731 states have (on average 1.310533515731874) internal successors, (958), 734 states have internal predecessors, (958), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-12 02:20:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1126 transitions. [2023-11-12 02:20:39,323 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1126 transitions. Word has length 121 [2023-11-12 02:20:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:39,323 INFO L495 AbstractCegarLoop]: Abstraction has 825 states and 1126 transitions. [2023-11-12 02:20:39,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1126 transitions. [2023-11-12 02:20:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-12 02:20:39,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:39,326 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:39,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-12 02:20:39,326 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:39,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1134045471, now seen corresponding path program 1 times [2023-11-12 02:20:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561807437] [2023-11-12 02:20:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:40,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:40,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561807437] [2023-11-12 02:20:40,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561807437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:40,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:40,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:20:40,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975439459] [2023-11-12 02:20:40,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:40,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:20:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:40,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:20:40,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:40,217 INFO L87 Difference]: Start difference. First operand 825 states and 1126 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:40,788 INFO L93 Difference]: Finished difference Result 1995 states and 2711 transitions. [2023-11-12 02:20:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:20:40,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2023-11-12 02:20:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:40,796 INFO L225 Difference]: With dead ends: 1995 [2023-11-12 02:20:40,797 INFO L226 Difference]: Without dead ends: 1173 [2023-11-12 02:20:40,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:20:40,800 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 100 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:40,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 725 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:20:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-11-12 02:20:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 955. [2023-11-12 02:20:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 849 states have (on average 1.3003533568904593) internal successors, (1104), 855 states have internal predecessors, (1104), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-12 02:20:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1284 transitions. [2023-11-12 02:20:40,887 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1284 transitions. Word has length 121 [2023-11-12 02:20:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:40,888 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1284 transitions. [2023-11-12 02:20:40,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:20:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1284 transitions. [2023-11-12 02:20:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-12 02:20:40,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:40,890 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:40,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-12 02:20:40,892 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:40,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 348861872, now seen corresponding path program 1 times [2023-11-12 02:20:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:40,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761396790] [2023-11-12 02:20:40,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:41,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761396790] [2023-11-12 02:20:41,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761396790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:41,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:41,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:20:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192409464] [2023-11-12 02:20:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:41,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:20:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:41,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:20:41,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:20:41,628 INFO L87 Difference]: Start difference. First operand 955 states and 1284 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:42,413 INFO L93 Difference]: Finished difference Result 2095 states and 2850 transitions. [2023-11-12 02:20:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:20:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2023-11-12 02:20:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:42,423 INFO L225 Difference]: With dead ends: 2095 [2023-11-12 02:20:42,423 INFO L226 Difference]: Without dead ends: 1448 [2023-11-12 02:20:42,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:20:42,426 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 175 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:42,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 792 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:20:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2023-11-12 02:20:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 943. [2023-11-12 02:20:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 818 states have (on average 1.3031784841075795) internal successors, (1066), 826 states have internal predecessors, (1066), 108 states have call successors, (108), 16 states have call predecessors, (108), 16 states have return successors, (108), 100 states have call predecessors, (108), 108 states have call successors, (108) [2023-11-12 02:20:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1282 transitions. [2023-11-12 02:20:42,539 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1282 transitions. Word has length 121 [2023-11-12 02:20:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:42,539 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1282 transitions. [2023-11-12 02:20:42,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1282 transitions. [2023-11-12 02:20:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:20:42,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:42,542 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:42,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-12 02:20:42,543 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:42,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash 23744931, now seen corresponding path program 1 times [2023-11-12 02:20:42,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:42,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184412471] [2023-11-12 02:20:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:20:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:20:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:20:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:20:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:20:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:20:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:20:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:20:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:20:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:20:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:20:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:20:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:20:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:20:43,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:20:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184412471] [2023-11-12 02:20:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184412471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:20:43,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:20:43,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-12 02:20:43,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077261607] [2023-11-12 02:20:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:20:43,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 02:20:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:20:43,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 02:20:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:20:43,496 INFO L87 Difference]: Start difference. First operand 943 states and 1282 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:20:45,026 INFO L93 Difference]: Finished difference Result 2145 states and 2910 transitions. [2023-11-12 02:20:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-12 02:20:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-12 02:20:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:20:45,035 INFO L225 Difference]: With dead ends: 2145 [2023-11-12 02:20:45,035 INFO L226 Difference]: Without dead ends: 1205 [2023-11-12 02:20:45,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2023-11-12 02:20:45,040 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 965 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:20:45,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1078 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 02:20:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2023-11-12 02:20:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 960. [2023-11-12 02:20:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 835 states have (on average 1.3005988023952095) internal successors, (1086), 843 states have internal predecessors, (1086), 108 states have call successors, (108), 16 states have call predecessors, (108), 16 states have return successors, (108), 100 states have call predecessors, (108), 108 states have call successors, (108) [2023-11-12 02:20:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1302 transitions. [2023-11-12 02:20:45,145 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1302 transitions. Word has length 122 [2023-11-12 02:20:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:20:45,146 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1302 transitions. [2023-11-12 02:20:45,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-12 02:20:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1302 transitions. [2023-11-12 02:20:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:20:45,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:20:45,148 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:20:45,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-12 02:20:45,149 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:20:45,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:20:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash 724809509, now seen corresponding path program 1 times [2023-11-12 02:20:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:20:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105632384] [2023-11-12 02:20:45,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:20:45,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:20:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat