/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:29:25,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:29:25,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:29:25,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:29:25,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:29:25,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:29:25,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:29:25,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:29:25,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:29:25,332 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:29:25,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:29:25,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:29:25,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:29:25,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:29:25,334 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:29:25,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:29:25,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:29:25,335 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:29:25,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:29:25,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:29:25,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:29:25,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:29:25,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:29:25,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:29:25,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:29:25,341 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:29:25,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:29:25,341 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:29:25,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:29:25,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:29:25,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:29:25,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:29:25,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:25,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:29:25,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:29:25,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:29:25,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:29:25,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:29:25,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:29:25,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:29:25,346 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:29:25,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:29:25,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:29:25,346 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: Use bitabs translation -> true [2023-12-15 21:29:25,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:29:25,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:29:25,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:29:25,597 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:29:25,599 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:29:25,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-12-15 21:29:26,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:29:26,961 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:29:26,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-12-15 21:29:26,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d05bfdd/de370991bb7f43ed8feb197f9933a1df/FLAG0c91142cf [2023-12-15 21:29:26,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d05bfdd/de370991bb7f43ed8feb197f9933a1df [2023-12-15 21:29:26,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:29:26,991 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:29:26,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:26,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:29:26,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:29:26,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:26" (1/1) ... [2023-12-15 21:29:26,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a02f0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:26, skipping insertion in model container [2023-12-15 21:29:26,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:26" (1/1) ... [2023-12-15 21:29:27,027 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:29:27,172 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-12-15 21:29:27,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:27,232 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:29:27,241 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-12-15 21:29:27,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:27,287 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:29:27,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27 WrapperNode [2023-12-15 21:29:27,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:27,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:27,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:29:27,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:29:27,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,350 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2023-12-15 21:29:27,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:27,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:29:27,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:29:27,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:29:27,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,399 INFO L175 MemorySlicer]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23]. 40 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 5, 2, 1, 2]. The 16 writes are split as follows [0, 2, 6, 4, 1, 3]. [2023-12-15 21:29:27,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:29:27,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:29:27,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:29:27,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:29:27,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (1/1) ... [2023-12-15 21:29:27,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:27,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:27,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:29:27,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:29:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:29:27,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:29:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:29:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:29:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:29:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:29:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:29:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:29:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:29:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:29:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:29:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:29:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:29:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:29:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:29:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:29:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:29:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:29:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:29:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:29:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:29:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:29:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:29:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:29:27,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:29:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:29:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:29:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:29:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:29:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:29:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:29:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:29:27,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:29:27,685 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:29:27,688 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:29:28,192 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:29:28,217 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:29:28,217 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:29:28,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:28 BoogieIcfgContainer [2023-12-15 21:29:28,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:29:28,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:29:28,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:29:28,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:29:28,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:29:26" (1/3) ... [2023-12-15 21:29:28,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc2129d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:28, skipping insertion in model container [2023-12-15 21:29:28,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:27" (2/3) ... [2023-12-15 21:29:28,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc2129d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:28, skipping insertion in model container [2023-12-15 21:29:28,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:28" (3/3) ... [2023-12-15 21:29:28,227 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2023-12-15 21:29:28,242 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:29:28,242 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:29:28,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:29:28,286 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;@e79fe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:29:28,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:29:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 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-12-15 21:29:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:29:28,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:28,301 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] [2023-12-15 21:29:28,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:28,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:28,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1666154856, now seen corresponding path program 1 times [2023-12-15 21:29:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:28,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618811808] [2023-12-15 21:29:28,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:28,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:28,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:28,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618811808] [2023-12-15 21:29:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618811808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:28,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:28,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:29:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038831700] [2023-12-15 21:29:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:28,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:29:28,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:29:28,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:29:28,693 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-12-15 21:29:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:28,734 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-12-15 21:29:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:29:28,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (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 110 [2023-12-15 21:29:28,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:28,746 INFO L225 Difference]: With dead ends: 209 [2023-12-15 21:29:28,747 INFO L226 Difference]: Without dead ends: 104 [2023-12-15 21:29:28,751 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-12-15 21:29:28,757 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 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-12-15 21:29:28,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-15 21:29:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-15 21:29:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 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-12-15 21:29:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-15 21:29:28,822 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-12-15 21:29:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:28,823 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-15 21:29:28,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (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-12-15 21:29:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-15 21:29:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:29:28,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:28,827 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] [2023-12-15 21:29:28,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:29:28,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:28,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1359425398, now seen corresponding path program 1 times [2023-12-15 21:29:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827811165] [2023-12-15 21:29:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827811165] [2023-12-15 21:29:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827811165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931637257] [2023-12-15 21:29:29,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:29,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:29,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:29,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:29,093 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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-12-15 21:29:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:29,175 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2023-12-15 21:29:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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 110 [2023-12-15 21:29:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:29,178 INFO L225 Difference]: With dead ends: 213 [2023-12-15 21:29:29,178 INFO L226 Difference]: Without dead ends: 110 [2023-12-15 21:29:29,179 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-12-15 21:29:29,180 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 10 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:29,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 436 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-15 21:29:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2023-12-15 21:29:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 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-12-15 21:29:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-12-15 21:29:29,192 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2023-12-15 21:29:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:29,192 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-12-15 21:29:29,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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-12-15 21:29:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-12-15 21:29:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:29:29,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:29,194 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] [2023-12-15 21:29:29,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:29:29,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:29,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash -627457972, now seen corresponding path program 1 times [2023-12-15 21:29:29,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:29,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983923736] [2023-12-15 21:29:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:29,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:29,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983923736] [2023-12-15 21:29:29,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983923736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:29,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:29:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611139014] [2023-12-15 21:29:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:29,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:29:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:29:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:29,380 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (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-12-15 21:29:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:29,419 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2023-12-15 21:29:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:29:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (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 110 [2023-12-15 21:29:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:29,422 INFO L225 Difference]: With dead ends: 212 [2023-12-15 21:29:29,422 INFO L226 Difference]: Without dead ends: 107 [2023-12-15 21:29:29,422 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-12-15 21:29:29,423 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:29,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-15 21:29:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-15 21:29:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 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-12-15 21:29:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-12-15 21:29:29,437 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 110 [2023-12-15 21:29:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:29,438 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-12-15 21:29:29,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (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-12-15 21:29:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-12-15 21:29:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:29:29,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:29,440 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] [2023-12-15 21:29:29,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:29:29,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:29,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1673364618, now seen corresponding path program 1 times [2023-12-15 21:29:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:29,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990711061] [2023-12-15 21:29:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990711061] [2023-12-15 21:29:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990711061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:29,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:29:29,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211759370] [2023-12-15 21:29:29,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:29,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:29:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:29,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:29:29,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:29,640 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (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-12-15 21:29:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:29,677 INFO L93 Difference]: Finished difference Result 237 states and 344 transitions. [2023-12-15 21:29:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:29:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (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 110 [2023-12-15 21:29:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:29,679 INFO L225 Difference]: With dead ends: 237 [2023-12-15 21:29:29,679 INFO L226 Difference]: Without dead ends: 131 [2023-12-15 21:29:29,680 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-12-15 21:29:29,682 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:29,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-15 21:29:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-12-15 21:29:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 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-12-15 21:29:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-12-15 21:29:29,691 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 110 [2023-12-15 21:29:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:29,691 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-12-15 21:29:29,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (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-12-15 21:29:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-12-15 21:29:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:29:29,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:29,693 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] [2023-12-15 21:29:29,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:29:29,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:29,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1920538100, now seen corresponding path program 1 times [2023-12-15 21:29:29,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:29,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683528879] [2023-12-15 21:29:29,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683528879] [2023-12-15 21:29:30,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683528879] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:30,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:30,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:29:30,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917606566] [2023-12-15 21:29:30,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:30,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:29:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:30,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:29:30,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:29:30,181 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-12-15 21:29:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:30,302 INFO L93 Difference]: Finished difference Result 322 states and 464 transitions. [2023-12-15 21:29:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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 110 [2023-12-15 21:29:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:30,305 INFO L225 Difference]: With dead ends: 322 [2023-12-15 21:29:30,305 INFO L226 Difference]: Without dead ends: 215 [2023-12-15 21:29:30,306 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-12-15 21:29:30,315 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 166 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:30,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 826 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-15 21:29:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2023-12-15 21:29:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 169 states have internal predecessors, (236), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:29:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2023-12-15 21:29:30,338 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 110 [2023-12-15 21:29:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:30,340 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2023-12-15 21:29:30,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-12-15 21:29:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2023-12-15 21:29:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 21:29:30,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:30,345 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] [2023-12-15 21:29:30,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:29:30,346 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:30,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash 968016930, now seen corresponding path program 1 times [2023-12-15 21:29:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:30,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400791816] [2023-12-15 21:29:30,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:30,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:30,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:30,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400791816] [2023-12-15 21:29:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400791816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983814581] [2023-12-15 21:29:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:30,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:30,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:30,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:30,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:30,567 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-12-15 21:29:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:30,618 INFO L93 Difference]: Finished difference Result 613 states and 887 transitions. [2023-12-15 21:29:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:30,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 111 [2023-12-15 21:29:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:30,624 INFO L225 Difference]: With dead ends: 613 [2023-12-15 21:29:30,624 INFO L226 Difference]: Without dead ends: 423 [2023-12-15 21:29:30,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-12-15 21:29:30,627 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 176 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:30,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 449 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:30,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-15 21:29:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 373. [2023-12-15 21:29:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 328 states have (on average 1.4054878048780488) internal successors, (461), 330 states have internal predecessors, (461), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:29:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 541 transitions. [2023-12-15 21:29:30,657 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 541 transitions. Word has length 111 [2023-12-15 21:29:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:30,657 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 541 transitions. [2023-12-15 21:29:30,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-12-15 21:29:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 541 transitions. [2023-12-15 21:29:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 21:29:30,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:30,659 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] [2023-12-15 21:29:30,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:29:30,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:30,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1986392456, now seen corresponding path program 1 times [2023-12-15 21:29:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:30,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379761251] [2023-12-15 21:29:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:30,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:30,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379761251] [2023-12-15 21:29:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379761251] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:30,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254459229] [2023-12-15 21:29:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:30,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:30,843 INFO L87 Difference]: Start difference. First operand 373 states and 541 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12-15 21:29:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:30,901 INFO L93 Difference]: Finished difference Result 749 states and 1085 transitions. [2023-12-15 21:29:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 112 [2023-12-15 21:29:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:30,904 INFO L225 Difference]: With dead ends: 749 [2023-12-15 21:29:30,904 INFO L226 Difference]: Without dead ends: 377 [2023-12-15 21:29:30,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-12-15 21:29:30,907 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:30,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-15 21:29:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 372. [2023-12-15 21:29:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 327 states have (on average 1.4036697247706422) internal successors, (459), 329 states have internal predecessors, (459), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:29:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 539 transitions. [2023-12-15 21:29:30,936 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 539 transitions. Word has length 112 [2023-12-15 21:29:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:30,936 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 539 transitions. [2023-12-15 21:29:30,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-12-15 21:29:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 539 transitions. [2023-12-15 21:29:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:29:30,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:30,938 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] [2023-12-15 21:29:30,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:29:30,938 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:30,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash -633881842, now seen corresponding path program 1 times [2023-12-15 21:29:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:30,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418446647] [2023-12-15 21:29:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:31,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418446647] [2023-12-15 21:29:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418446647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:31,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125767248] [2023-12-15 21:29:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:31,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:31,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:31,254 INFO L87 Difference]: Start difference. First operand 372 states and 539 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-12-15 21:29:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:31,435 INFO L93 Difference]: Finished difference Result 999 states and 1447 transitions. [2023-12-15 21:29:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:31,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 113 [2023-12-15 21:29:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:31,441 INFO L225 Difference]: With dead ends: 999 [2023-12-15 21:29:31,442 INFO L226 Difference]: Without dead ends: 628 [2023-12-15 21:29:31,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:29:31,445 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 221 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:31,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1070 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2023-12-15 21:29:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 584. [2023-12-15 21:29:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 513 states have (on average 1.3996101364522417) internal successors, (718), 515 states have internal predecessors, (718), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-15 21:29:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 846 transitions. [2023-12-15 21:29:31,487 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 846 transitions. Word has length 113 [2023-12-15 21:29:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:31,487 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 846 transitions. [2023-12-15 21:29:31,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-12-15 21:29:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 846 transitions. [2023-12-15 21:29:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:29:31,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:31,489 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] [2023-12-15 21:29:31,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:29:31,489 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:31,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1713590941, now seen corresponding path program 1 times [2023-12-15 21:29:31,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:31,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651117158] [2023-12-15 21:29:31,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:31,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:32,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:32,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651117158] [2023-12-15 21:29:32,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651117158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:32,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:32,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:32,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633085193] [2023-12-15 21:29:32,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:32,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:32,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:32,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:32,023 INFO L87 Difference]: Start difference. First operand 584 states and 846 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-12-15 21:29:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:32,163 INFO L93 Difference]: Finished difference Result 1561 states and 2241 transitions. [2023-12-15 21:29:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:32,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 113 [2023-12-15 21:29:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:32,168 INFO L225 Difference]: With dead ends: 1561 [2023-12-15 21:29:32,168 INFO L226 Difference]: Without dead ends: 978 [2023-12-15 21:29:32,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:29:32,171 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 145 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:32,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 789 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2023-12-15 21:29:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 900. [2023-12-15 21:29:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 811 states have (on average 1.3958076448828607) internal successors, (1132), 819 states have internal predecessors, (1132), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1284 transitions. [2023-12-15 21:29:32,219 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1284 transitions. Word has length 113 [2023-12-15 21:29:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:32,219 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1284 transitions. [2023-12-15 21:29:32,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-12-15 21:29:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1284 transitions. [2023-12-15 21:29:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:29:32,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:32,221 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] [2023-12-15 21:29:32,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:29:32,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:32,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 480306248, now seen corresponding path program 1 times [2023-12-15 21:29:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:32,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707617896] [2023-12-15 21:29:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707617896] [2023-12-15 21:29:33,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707617896] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:33,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:33,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-15 21:29:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731792564] [2023-12-15 21:29:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:33,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 21:29:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:33,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 21:29:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:29:33,377 INFO L87 Difference]: Start difference. First operand 900 states and 1284 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:35,256 INFO L93 Difference]: Finished difference Result 2998 states and 4280 transitions. [2023-12-15 21:29:35,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-15 21:29:35,256 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2023-12-15 21:29:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:35,271 INFO L225 Difference]: With dead ends: 2998 [2023-12-15 21:29:35,271 INFO L226 Difference]: Without dead ends: 2539 [2023-12-15 21:29:35,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1139, Unknown=0, NotChecked=0, Total=1406 [2023-12-15 21:29:35,275 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1121 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:35,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3171 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 21:29:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2023-12-15 21:29:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 1965. [2023-12-15 21:29:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1753 states have (on average 1.3953223046206502) internal successors, (2446), 1771 states have internal predecessors, (2446), 182 states have call successors, (182), 29 states have call predecessors, (182), 29 states have return successors, (182), 164 states have call predecessors, (182), 182 states have call successors, (182) [2023-12-15 21:29:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2810 transitions. [2023-12-15 21:29:35,421 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2810 transitions. Word has length 113 [2023-12-15 21:29:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:35,421 INFO L495 AbstractCegarLoop]: Abstraction has 1965 states and 2810 transitions. [2023-12-15 21:29:35,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 15 states have internal predecessors, (56), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2810 transitions. [2023-12-15 21:29:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 21:29:35,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:35,424 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] [2023-12-15 21:29:35,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:29:35,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:35,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash 699160966, now seen corresponding path program 1 times [2023-12-15 21:29:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:35,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297274861] [2023-12-15 21:29:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:35,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:35,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297274861] [2023-12-15 21:29:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297274861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:35,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:35,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136286059] [2023-12-15 21:29:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:35,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:35,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:35,737 INFO L87 Difference]: Start difference. First operand 1965 states and 2810 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-12-15 21:29:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:35,876 INFO L93 Difference]: Finished difference Result 2460 states and 3491 transitions. [2023-12-15 21:29:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:29:35,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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 113 [2023-12-15 21:29:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:35,882 INFO L225 Difference]: With dead ends: 2460 [2023-12-15 21:29:35,882 INFO L226 Difference]: Without dead ends: 1139 [2023-12-15 21:29:35,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:29:35,885 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 150 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:35,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 738 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2023-12-15 21:29:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 897. [2023-12-15 21:29:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 790 states have (on average 1.3810126582278481) internal successors, (1091), 794 states have internal predecessors, (1091), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:29:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1267 transitions. [2023-12-15 21:29:35,949 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1267 transitions. Word has length 113 [2023-12-15 21:29:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:35,949 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 1267 transitions. [2023-12-15 21:29:35,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 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-12-15 21:29:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1267 transitions. [2023-12-15 21:29:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:29:35,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:35,951 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] [2023-12-15 21:29:35,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:29:35,951 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:35,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 536390063, now seen corresponding path program 1 times [2023-12-15 21:29:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:35,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273923104] [2023-12-15 21:29:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:35,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:36,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:36,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273923104] [2023-12-15 21:29:36,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273923104] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:36,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:36,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:29:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354579004] [2023-12-15 21:29:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:36,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:29:36,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:36,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:29:36,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:36,377 INFO L87 Difference]: Start difference. First operand 897 states and 1267 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-12-15 21:29:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:36,830 INFO L93 Difference]: Finished difference Result 2178 states and 3072 transitions. [2023-12-15 21:29:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:29:36,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 114 [2023-12-15 21:29:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:36,835 INFO L225 Difference]: With dead ends: 2178 [2023-12-15 21:29:36,836 INFO L226 Difference]: Without dead ends: 1282 [2023-12-15 21:29:36,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:29:36,838 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 435 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:36,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1060 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:29:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2023-12-15 21:29:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 925. [2023-12-15 21:29:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 818 states have (on average 1.3777506112469438) internal successors, (1127), 822 states have internal predecessors, (1127), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:29:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1303 transitions. [2023-12-15 21:29:36,918 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1303 transitions. Word has length 114 [2023-12-15 21:29:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:36,919 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1303 transitions. [2023-12-15 21:29:36,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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-12-15 21:29:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1303 transitions. [2023-12-15 21:29:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 21:29:36,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:36,921 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] [2023-12-15 21:29:36,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:29:36,921 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:36,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:36,921 INFO L85 PathProgramCache]: Analyzing trace with hash -348434595, now seen corresponding path program 1 times [2023-12-15 21:29:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:36,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653418180] [2023-12-15 21:29:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:37,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653418180] [2023-12-15 21:29:37,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653418180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:37,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:37,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:37,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135128119] [2023-12-15 21:29:37,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:37,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:37,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:37,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:37,247 INFO L87 Difference]: Start difference. First operand 925 states and 1303 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-12-15 21:29:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:37,394 INFO L93 Difference]: Finished difference Result 2095 states and 2930 transitions. [2023-12-15 21:29:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:37,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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 114 [2023-12-15 21:29:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:37,400 INFO L225 Difference]: With dead ends: 2095 [2023-12-15 21:29:37,400 INFO L226 Difference]: Without dead ends: 1171 [2023-12-15 21:29:37,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:29:37,402 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 73 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:37,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 650 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2023-12-15 21:29:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 923. [2023-12-15 21:29:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 816 states have (on average 1.3713235294117647) internal successors, (1119), 820 states have internal predecessors, (1119), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:29:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1295 transitions. [2023-12-15 21:29:37,485 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1295 transitions. Word has length 114 [2023-12-15 21:29:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:37,486 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1295 transitions. [2023-12-15 21:29:37,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-12-15 21:29:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1295 transitions. [2023-12-15 21:29:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:29:37,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:37,487 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-12-15 21:29:37,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:29:37,488 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:37,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash -74891543, now seen corresponding path program 1 times [2023-12-15 21:29:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:37,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178307304] [2023-12-15 21:29:37,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178307304] [2023-12-15 21:29:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178307304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279794785] [2023-12-15 21:29:37,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:37,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:37,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:37,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:37,801 INFO L87 Difference]: Start difference. First operand 923 states and 1295 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:37,949 INFO L93 Difference]: Finished difference Result 1934 states and 2704 transitions. [2023-12-15 21:29:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:29:37,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:37,953 INFO L225 Difference]: With dead ends: 1934 [2023-12-15 21:29:37,954 INFO L226 Difference]: Without dead ends: 1012 [2023-12-15 21:29:37,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:29:37,956 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 75 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:37,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 887 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2023-12-15 21:29:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 873. [2023-12-15 21:29:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 766 states have (on average 1.3694516971279374) internal successors, (1049), 770 states have internal predecessors, (1049), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:29:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1225 transitions. [2023-12-15 21:29:38,023 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1225 transitions. Word has length 115 [2023-12-15 21:29:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:38,026 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1225 transitions. [2023-12-15 21:29:38,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1225 transitions. [2023-12-15 21:29:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:29:38,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:38,028 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-12-15 21:29:38,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:29:38,028 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:38,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 149492180, now seen corresponding path program 1 times [2023-12-15 21:29:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540162758] [2023-12-15 21:29:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540162758] [2023-12-15 21:29:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540162758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:38,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483698815] [2023-12-15 21:29:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:38,328 INFO L87 Difference]: Start difference. First operand 873 states and 1225 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:38,472 INFO L93 Difference]: Finished difference Result 1874 states and 2620 transitions. [2023-12-15 21:29:38,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:29:38,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:38,476 INFO L225 Difference]: With dead ends: 1874 [2023-12-15 21:29:38,476 INFO L226 Difference]: Without dead ends: 1002 [2023-12-15 21:29:38,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:29:38,480 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 74 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:38,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 676 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2023-12-15 21:29:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 871. [2023-12-15 21:29:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 764 states have (on average 1.362565445026178) internal successors, (1041), 768 states have internal predecessors, (1041), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:29:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1217 transitions. [2023-12-15 21:29:38,546 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1217 transitions. Word has length 115 [2023-12-15 21:29:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:38,546 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1217 transitions. [2023-12-15 21:29:38,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1217 transitions. [2023-12-15 21:29:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:29:38,548 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:38,548 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-12-15 21:29:38,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:29:38,548 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:38,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1655946154, now seen corresponding path program 1 times [2023-12-15 21:29:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441539033] [2023-12-15 21:29:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:38,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:38,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441539033] [2023-12-15 21:29:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441539033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:38,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:38,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333046995] [2023-12-15 21:29:38,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:38,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:38,879 INFO L87 Difference]: Start difference. First operand 871 states and 1217 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:39,016 INFO L93 Difference]: Finished difference Result 1936 states and 2699 transitions. [2023-12-15 21:29:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:29:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:39,020 INFO L225 Difference]: With dead ends: 1936 [2023-12-15 21:29:39,020 INFO L226 Difference]: Without dead ends: 1066 [2023-12-15 21:29:39,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:29:39,023 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 97 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:39,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 736 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2023-12-15 21:29:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 871. [2023-12-15 21:29:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 764 states have (on average 1.3494764397905759) internal successors, (1031), 768 states have internal predecessors, (1031), 88 states have call successors, (88), 18 states have call predecessors, (88), 18 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-15 21:29:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1207 transitions. [2023-12-15 21:29:39,085 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1207 transitions. Word has length 115 [2023-12-15 21:29:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:39,086 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1207 transitions. [2023-12-15 21:29:39,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 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-12-15 21:29:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1207 transitions. [2023-12-15 21:29:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:29:39,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:39,087 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-12-15 21:29:39,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:29:39,088 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:39,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1359157464, now seen corresponding path program 1 times [2023-12-15 21:29:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817414189] [2023-12-15 21:29:39,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:39,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817414189] [2023-12-15 21:29:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817414189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:39,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:29:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154082245] [2023-12-15 21:29:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:39,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:29:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:29:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:39,530 INFO L87 Difference]: Start difference. First operand 871 states and 1207 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12-15 21:29:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:39,908 INFO L93 Difference]: Finished difference Result 1673 states and 2312 transitions. [2023-12-15 21:29:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12-15 21:29:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:39,912 INFO L225 Difference]: With dead ends: 1673 [2023-12-15 21:29:39,912 INFO L226 Difference]: Without dead ends: 781 [2023-12-15 21:29:39,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-12-15 21:29:39,914 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 389 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:39,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 992 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:29:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-12-15 21:29:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 751. [2023-12-15 21:29:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 659 states have (on average 1.3490136570561457) internal successors, (889), 662 states have internal predecessors, (889), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1041 transitions. [2023-12-15 21:29:39,957 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1041 transitions. Word has length 115 [2023-12-15 21:29:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:39,957 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1041 transitions. [2023-12-15 21:29:39,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12-15 21:29:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1041 transitions. [2023-12-15 21:29:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 21:29:39,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:39,959 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-12-15 21:29:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:29:39,959 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:39,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash 849684374, now seen corresponding path program 1 times [2023-12-15 21:29:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:39,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937189765] [2023-12-15 21:29:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:40,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:40,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937189765] [2023-12-15 21:29:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937189765] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:40,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:29:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838734034] [2023-12-15 21:29:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:40,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:29:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:29:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:40,345 INFO L87 Difference]: Start difference. First operand 751 states and 1041 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12-15 21:29:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:40,715 INFO L93 Difference]: Finished difference Result 1661 states and 2299 transitions. [2023-12-15 21:29:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:40,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12-15 21:29:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:40,719 INFO L225 Difference]: With dead ends: 1661 [2023-12-15 21:29:40,719 INFO L226 Difference]: Without dead ends: 911 [2023-12-15 21:29:40,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:29:40,721 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 311 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:40,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 978 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:29:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2023-12-15 21:29:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 751. [2023-12-15 21:29:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 659 states have (on average 1.347496206373293) internal successors, (888), 662 states have internal predecessors, (888), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1040 transitions. [2023-12-15 21:29:40,770 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1040 transitions. Word has length 115 [2023-12-15 21:29:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:40,770 INFO L495 AbstractCegarLoop]: Abstraction has 751 states and 1040 transitions. [2023-12-15 21:29:40,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12-15 21:29:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1040 transitions. [2023-12-15 21:29:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:29:40,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:40,772 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-12-15 21:29:40,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:29:40,772 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:40,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1639103148, now seen corresponding path program 1 times [2023-12-15 21:29:40,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:40,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116995874] [2023-12-15 21:29:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,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-12-15 21:29:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:41,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116995874] [2023-12-15 21:29:41,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116995874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:41,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:41,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:29:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312144988] [2023-12-15 21:29:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:41,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:29:41,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:41,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:29:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:29:41,564 INFO L87 Difference]: Start difference. First operand 751 states and 1040 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:42,890 INFO L93 Difference]: Finished difference Result 1494 states and 2076 transitions. [2023-12-15 21:29:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:29:42,891 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-15 21:29:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:42,895 INFO L225 Difference]: With dead ends: 1494 [2023-12-15 21:29:42,895 INFO L226 Difference]: Without dead ends: 1148 [2023-12-15 21:29:42,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:29:42,896 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 401 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:42,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 2323 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 21:29:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2023-12-15 21:29:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 793. [2023-12-15 21:29:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 701 states have (on average 1.3452211126961484) internal successors, (943), 704 states have internal predecessors, (943), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1095 transitions. [2023-12-15 21:29:42,960 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1095 transitions. Word has length 116 [2023-12-15 21:29:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:42,961 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1095 transitions. [2023-12-15 21:29:42,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1095 transitions. [2023-12-15 21:29:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:29:42,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:42,962 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-12-15 21:29:42,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:29:42,962 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:42,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1498554538, now seen corresponding path program 1 times [2023-12-15 21:29:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:42,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147212466] [2023-12-15 21:29:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:43,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147212466] [2023-12-15 21:29:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147212466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:43,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:43,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:29:43,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299954159] [2023-12-15 21:29:43,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:43,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:29:43,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:43,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:29:43,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:29:43,794 INFO L87 Difference]: Start difference. First operand 793 states and 1095 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:45,088 INFO L93 Difference]: Finished difference Result 1548 states and 2146 transitions. [2023-12-15 21:29:45,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:29:45,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-15 21:29:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:45,093 INFO L225 Difference]: With dead ends: 1548 [2023-12-15 21:29:45,093 INFO L226 Difference]: Without dead ends: 1160 [2023-12-15 21:29:45,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:29:45,095 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 396 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:45,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2338 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 21:29:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2023-12-15 21:29:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 763. [2023-12-15 21:29:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 671 states have (on average 1.34575260804769) internal successors, (903), 674 states have internal predecessors, (903), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1055 transitions. [2023-12-15 21:29:45,173 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1055 transitions. Word has length 116 [2023-12-15 21:29:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:45,174 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1055 transitions. [2023-12-15 21:29:45,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1055 transitions. [2023-12-15 21:29:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:29:45,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:45,175 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-12-15 21:29:45,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:29:45,175 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:45,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1908231937, now seen corresponding path program 1 times [2023-12-15 21:29:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382898840] [2023-12-15 21:29:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382898840] [2023-12-15 21:29:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382898840] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:45,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:45,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:29:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251090516] [2023-12-15 21:29:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:45,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:29:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:45,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:29:45,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:29:45,497 INFO L87 Difference]: Start difference. First operand 763 states and 1055 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-12-15 21:29:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:45,748 INFO L93 Difference]: Finished difference Result 1674 states and 2316 transitions. [2023-12-15 21:29:45,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:29:45,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-12-15 21:29:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:45,752 INFO L225 Difference]: With dead ends: 1674 [2023-12-15 21:29:45,752 INFO L226 Difference]: Without dead ends: 912 [2023-12-15 21:29:45,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:29:45,756 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 381 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:45,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1383 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2023-12-15 21:29:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 774. [2023-12-15 21:29:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 682 states have (on average 1.3387096774193548) internal successors, (913), 685 states have internal predecessors, (913), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1065 transitions. [2023-12-15 21:29:45,831 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1065 transitions. Word has length 116 [2023-12-15 21:29:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:45,831 INFO L495 AbstractCegarLoop]: Abstraction has 774 states and 1065 transitions. [2023-12-15 21:29:45,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-12-15 21:29:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1065 transitions. [2023-12-15 21:29:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 21:29:45,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:45,833 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-12-15 21:29:45,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 21:29:45,834 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:45,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1964033533, now seen corresponding path program 1 times [2023-12-15 21:29:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:45,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942236079] [2023-12-15 21:29:45,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942236079] [2023-12-15 21:29:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942236079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882488575] [2023-12-15 21:29:46,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:46,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:46,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:46,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:46,200 INFO L87 Difference]: Start difference. First operand 774 states and 1065 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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-12-15 21:29:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:46,343 INFO L93 Difference]: Finished difference Result 1727 states and 2378 transitions. [2023-12-15 21:29:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:46,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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 116 [2023-12-15 21:29:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:46,347 INFO L225 Difference]: With dead ends: 1727 [2023-12-15 21:29:46,347 INFO L226 Difference]: Without dead ends: 954 [2023-12-15 21:29:46,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-12-15 21:29:46,349 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 115 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:46,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1013 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2023-12-15 21:29:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 776. [2023-12-15 21:29:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 684 states have (on average 1.337719298245614) internal successors, (915), 687 states have internal predecessors, (915), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1067 transitions. [2023-12-15 21:29:46,423 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1067 transitions. Word has length 116 [2023-12-15 21:29:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:46,423 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1067 transitions. [2023-12-15 21:29:46,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 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-12-15 21:29:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1067 transitions. [2023-12-15 21:29:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:29:46,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:46,425 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-12-15 21:29:46,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 21:29:46,426 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:46,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1204295652, now seen corresponding path program 1 times [2023-12-15 21:29:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:46,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550422634] [2023-12-15 21:29:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:47,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550422634] [2023-12-15 21:29:47,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550422634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:47,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:47,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:29:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556759457] [2023-12-15 21:29:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:47,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:29:47,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:47,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:29:47,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:29:47,379 INFO L87 Difference]: Start difference. First operand 776 states and 1067 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:49,656 INFO L93 Difference]: Finished difference Result 1603 states and 2208 transitions. [2023-12-15 21:29:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 21:29:49,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-15 21:29:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:49,662 INFO L225 Difference]: With dead ends: 1603 [2023-12-15 21:29:49,662 INFO L226 Difference]: Without dead ends: 1229 [2023-12-15 21:29:49,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-12-15 21:29:49,664 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 549 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:49,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1607 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 21:29:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2023-12-15 21:29:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 796. [2023-12-15 21:29:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 704 states have (on average 1.3352272727272727) internal successors, (940), 707 states have internal predecessors, (940), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1092 transitions. [2023-12-15 21:29:49,749 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1092 transitions. Word has length 117 [2023-12-15 21:29:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:49,750 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1092 transitions. [2023-12-15 21:29:49,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1092 transitions. [2023-12-15 21:29:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:29:49,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:49,752 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-12-15 21:29:49,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 21:29:49,752 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:49,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1266335266, now seen corresponding path program 1 times [2023-12-15 21:29:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633709810] [2023-12-15 21:29:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:50,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:50,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633709810] [2023-12-15 21:29:50,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633709810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:50,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:50,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:29:50,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056795434] [2023-12-15 21:29:50,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:50,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:29:50,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:50,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:29:50,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:29:50,526 INFO L87 Difference]: Start difference. First operand 796 states and 1092 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:52,073 INFO L93 Difference]: Finished difference Result 1655 states and 2278 transitions. [2023-12-15 21:29:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:29:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-15 21:29:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:52,079 INFO L225 Difference]: With dead ends: 1655 [2023-12-15 21:29:52,079 INFO L226 Difference]: Without dead ends: 1261 [2023-12-15 21:29:52,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-15 21:29:52,081 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 531 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:52,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1745 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 21:29:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2023-12-15 21:29:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 777. [2023-12-15 21:29:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 685 states have (on average 1.3372262773722627) internal successors, (916), 688 states have internal predecessors, (916), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1068 transitions. [2023-12-15 21:29:52,176 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1068 transitions. Word has length 117 [2023-12-15 21:29:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:52,176 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1068 transitions. [2023-12-15 21:29:52,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1068 transitions. [2023-12-15 21:29:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:29:52,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:52,177 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-12-15 21:29:52,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 21:29:52,178 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:52,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1690555580, now seen corresponding path program 1 times [2023-12-15 21:29:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441408925] [2023-12-15 21:29:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:52,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441408925] [2023-12-15 21:29:52,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441408925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:52,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:52,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:52,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936928491] [2023-12-15 21:29:52,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:52,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:52,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:52,445 INFO L87 Difference]: Start difference. First operand 777 states and 1068 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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-12-15 21:29:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:52,629 INFO L93 Difference]: Finished difference Result 1754 states and 2412 transitions. [2023-12-15 21:29:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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 117 [2023-12-15 21:29:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:52,633 INFO L225 Difference]: With dead ends: 1754 [2023-12-15 21:29:52,634 INFO L226 Difference]: Without dead ends: 978 [2023-12-15 21:29:52,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:29:52,636 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 129 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:52,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 736 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2023-12-15 21:29:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 787. [2023-12-15 21:29:52,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 695 states have (on average 1.3280575539568344) internal successors, (923), 698 states have internal predecessors, (923), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-15 21:29:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1075 transitions. [2023-12-15 21:29:52,730 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1075 transitions. Word has length 117 [2023-12-15 21:29:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:52,731 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1075 transitions. [2023-12-15 21:29:52,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 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-12-15 21:29:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1075 transitions. [2023-12-15 21:29:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:29:52,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:52,733 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-12-15 21:29:52,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 21:29:52,733 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:52,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1539091155, now seen corresponding path program 1 times [2023-12-15 21:29:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498562814] [2023-12-15 21:29:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:53,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498562814] [2023-12-15 21:29:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498562814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:29:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428879105] [2023-12-15 21:29:53,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:53,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:29:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:29:53,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:29:53,418 INFO L87 Difference]: Start difference. First operand 787 states and 1075 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 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-12-15 21:29:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:53,881 INFO L93 Difference]: Finished difference Result 1695 states and 2311 transitions. [2023-12-15 21:29:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:29:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 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 117 [2023-12-15 21:29:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:53,885 INFO L225 Difference]: With dead ends: 1695 [2023-12-15 21:29:53,885 INFO L226 Difference]: Without dead ends: 909 [2023-12-15 21:29:53,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:29:53,887 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 582 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:53,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 833 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:29:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2023-12-15 21:29:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 841. [2023-12-15 21:29:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.3247282608695652) internal successors, (975), 740 states have internal predecessors, (975), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-15 21:29:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1147 transitions. [2023-12-15 21:29:53,980 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1147 transitions. Word has length 117 [2023-12-15 21:29:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:53,981 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1147 transitions. [2023-12-15 21:29:53,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 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-12-15 21:29:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1147 transitions. [2023-12-15 21:29:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:29:53,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:53,982 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-12-15 21:29:53,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 21:29:53,983 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:53,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1146064145, now seen corresponding path program 1 times [2023-12-15 21:29:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638385234] [2023-12-15 21:29:53,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638385234] [2023-12-15 21:29:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638385234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:54,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 21:29:54,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971528822] [2023-12-15 21:29:54,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:54,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:29:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:54,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:29:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:29:54,500 INFO L87 Difference]: Start difference. First operand 841 states and 1147 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 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-12-15 21:29:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:55,022 INFO L93 Difference]: Finished difference Result 1654 states and 2248 transitions. [2023-12-15 21:29:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:29:55,024 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 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-12-15 21:29:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:55,027 INFO L225 Difference]: With dead ends: 1654 [2023-12-15 21:29:55,028 INFO L226 Difference]: Without dead ends: 864 [2023-12-15 21:29:55,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:29:55,030 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 531 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:55,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1583 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:29:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-12-15 21:29:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 841. [2023-12-15 21:29:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.3233695652173914) internal successors, (974), 740 states have internal predecessors, (974), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-15 21:29:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1146 transitions. [2023-12-15 21:29:55,120 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1146 transitions. Word has length 117 [2023-12-15 21:29:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:55,120 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1146 transitions. [2023-12-15 21:29:55,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 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-12-15 21:29:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1146 transitions. [2023-12-15 21:29:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 21:29:55,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:55,122 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-12-15 21:29:55,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 21:29:55,122 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:55,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1516458901, now seen corresponding path program 1 times [2023-12-15 21:29:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:55,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120322155] [2023-12-15 21:29:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:56,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120322155] [2023-12-15 21:29:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120322155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:56,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:56,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-15 21:29:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979759485] [2023-12-15 21:29:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:56,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-15 21:29:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-15 21:29:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:29:56,560 INFO L87 Difference]: Start difference. First operand 841 states and 1146 transitions. Second operand has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:58,224 INFO L93 Difference]: Finished difference Result 1733 states and 2349 transitions. [2023-12-15 21:29:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:29:58,227 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-15 21:29:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:58,230 INFO L225 Difference]: With dead ends: 1733 [2023-12-15 21:29:58,230 INFO L226 Difference]: Without dead ends: 943 [2023-12-15 21:29:58,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=260, Invalid=1146, Unknown=0, NotChecked=0, Total=1406 [2023-12-15 21:29:58,233 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 682 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:58,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 3191 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 21:29:58,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2023-12-15 21:29:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 800. [2023-12-15 21:29:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 708 states have (on average 1.3192090395480225) internal successors, (934), 711 states have internal predecessors, (934), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-15 21:29:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1082 transitions. [2023-12-15 21:29:58,316 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1082 transitions. Word has length 117 [2023-12-15 21:29:58,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:58,316 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1082 transitions. [2023-12-15 21:29:58,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 19 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:29:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1082 transitions. [2023-12-15 21:29:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:58,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:58,318 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-12-15 21:29:58,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-15 21:29:58,318 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:58,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash -188901552, now seen corresponding path program 1 times [2023-12-15 21:29:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495619711] [2023-12-15 21:29:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:58,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:58,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495619711] [2023-12-15 21:29:58,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495619711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:58,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:58,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:29:58,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171530816] [2023-12-15 21:29:58,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:58,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:29:58,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:58,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:29:58,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:29:58,883 INFO L87 Difference]: Start difference. First operand 800 states and 1082 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 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-12-15 21:29:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:59,232 INFO L93 Difference]: Finished difference Result 1306 states and 1780 transitions. [2023-12-15 21:29:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:29:59,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 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-12-15 21:29:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:59,247 INFO L225 Difference]: With dead ends: 1306 [2023-12-15 21:29:59,247 INFO L226 Difference]: Without dead ends: 913 [2023-12-15 21:29:59,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:29:59,249 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 154 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:59,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1614 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:29:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2023-12-15 21:29:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 809. [2023-12-15 21:29:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 717 states have (on average 1.3152022315202232) internal successors, (943), 720 states have internal predecessors, (943), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-15 21:29:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1091 transitions. [2023-12-15 21:29:59,351 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1091 transitions. Word has length 119 [2023-12-15 21:29:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:59,351 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1091 transitions. [2023-12-15 21:29:59,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 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-12-15 21:29:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1091 transitions. [2023-12-15 21:29:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:59,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:59,353 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-12-15 21:29:59,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-15 21:29:59,353 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:59,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash -37437127, now seen corresponding path program 1 times [2023-12-15 21:29:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495283390] [2023-12-15 21:29:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:29:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:29:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:29:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:29:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:29:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:29:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495283390] [2023-12-15 21:29:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495283390] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410462079] [2023-12-15 21:29:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:59,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:59,614 INFO L87 Difference]: Start difference. First operand 809 states and 1091 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-12-15 21:29:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:59,786 INFO L93 Difference]: Finished difference Result 1294 states and 1745 transitions. [2023-12-15 21:29:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:29:59,786 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-12-15 21:29:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:59,789 INFO L225 Difference]: With dead ends: 1294 [2023-12-15 21:29:59,789 INFO L226 Difference]: Without dead ends: 892 [2023-12-15 21:29:59,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:29:59,791 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 75 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:59,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 815 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2023-12-15 21:29:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 809. [2023-12-15 21:29:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 717 states have (on average 1.3110181311018132) internal successors, (940), 720 states have internal predecessors, (940), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-15 21:29:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1088 transitions. [2023-12-15 21:29:59,872 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1088 transitions. Word has length 119 [2023-12-15 21:29:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:59,872 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1088 transitions. [2023-12-15 21:29:59,872 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-12-15 21:29:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1088 transitions. [2023-12-15 21:29:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:59,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:59,873 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-12-15 21:29:59,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-15 21:29:59,873 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:59,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1634563139, now seen corresponding path program 1 times [2023-12-15 21:29:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:59,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606159408] [2023-12-15 21:29:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:29:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:29:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:59,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:30:00,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606159408] [2023-12-15 21:30:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606159408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:00,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:00,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75431128] [2023-12-15 21:30:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:00,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:00,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:00,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:00,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:00,007 INFO L87 Difference]: Start difference. First operand 809 states and 1088 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-12-15 21:30:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:00,109 INFO L93 Difference]: Finished difference Result 1687 states and 2273 transitions. [2023-12-15 21:30:00,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:00,110 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-12-15 21:30:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:00,112 INFO L225 Difference]: With dead ends: 1687 [2023-12-15 21:30:00,112 INFO L226 Difference]: Without dead ends: 879 [2023-12-15 21:30:00,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:30:00,114 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 45 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:00,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2023-12-15 21:30:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 830. [2023-12-15 21:30:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 738 states have (on average 1.3021680216802167) internal successors, (961), 741 states have internal predecessors, (961), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-15 21:30:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1109 transitions. [2023-12-15 21:30:00,200 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1109 transitions. Word has length 119 [2023-12-15 21:30:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:00,201 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1109 transitions. [2023-12-15 21:30:00,201 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-12-15 21:30:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1109 transitions. [2023-12-15 21:30:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 21:30:00,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:00,202 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-12-15 21:30:00,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-15 21:30:00,202 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:00,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash 935107953, now seen corresponding path program 1 times [2023-12-15 21:30:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:00,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845278] [2023-12-15 21:30:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:30:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:30:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:30:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845278] [2023-12-15 21:30:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845278] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:01,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-15 21:30:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910869762] [2023-12-15 21:30:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:01,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 21:30:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 21:30:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:01,484 INFO L87 Difference]: Start difference. First operand 830 states and 1109 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:30:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:02,611 INFO L93 Difference]: Finished difference Result 1787 states and 2386 transitions. [2023-12-15 21:30:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:30:02,616 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 120 [2023-12-15 21:30:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:02,622 INFO L225 Difference]: With dead ends: 1787 [2023-12-15 21:30:02,622 INFO L226 Difference]: Without dead ends: 958 [2023-12-15 21:30:02,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2023-12-15 21:30:02,626 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 863 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:02,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2000 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:30:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2023-12-15 21:30:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 838. [2023-12-15 21:30:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 746 states have (on average 1.2989276139410189) internal successors, (969), 749 states have internal predecessors, (969), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-15 21:30:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1117 transitions. [2023-12-15 21:30:02,754 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1117 transitions. Word has length 120 [2023-12-15 21:30:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:02,754 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1117 transitions. [2023-12-15 21:30:02,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-15 21:30:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1117 transitions. [2023-12-15 21:30:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 21:30:02,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:02,755 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-12-15 21:30:02,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-15 21:30:02,755 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:02,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1328134963, now seen corresponding path program 1 times [2023-12-15 21:30:02,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:02,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499132816] [2023-12-15 21:30:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:02,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:30:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:30:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:30:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:03,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499132816] [2023-12-15 21:30:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499132816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:03,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:03,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:30:03,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247268819] [2023-12-15 21:30:03,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:03,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:30:03,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:03,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:30:03,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:30:03,331 INFO L87 Difference]: Start difference. First operand 838 states and 1117 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (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-12-15 21:30:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:03,808 INFO L93 Difference]: Finished difference Result 1731 states and 2306 transitions. [2023-12-15 21:30:03,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:30:03,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (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-12-15 21:30:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:03,810 INFO L225 Difference]: With dead ends: 1731 [2023-12-15 21:30:03,810 INFO L226 Difference]: Without dead ends: 894 [2023-12-15 21:30:03,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:30:03,812 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 319 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:03,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1239 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:30:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2023-12-15 21:30:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 821. [2023-12-15 21:30:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 729 states have (on average 1.297668038408779) internal successors, (946), 732 states have internal predecessors, (946), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-15 21:30:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1094 transitions. [2023-12-15 21:30:03,924 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1094 transitions. Word has length 120 [2023-12-15 21:30:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:03,924 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1094 transitions. [2023-12-15 21:30:03,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (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-12-15 21:30:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1094 transitions. [2023-12-15 21:30:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 21:30:03,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:03,925 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-12-15 21:30:03,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-15 21:30:03,926 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:03,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash -265899400, now seen corresponding path program 1 times [2023-12-15 21:30:03,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:03,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176846144] [2023-12-15 21:30:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:30:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:30:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:30:04,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:04,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176846144] [2023-12-15 21:30:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176846144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:30:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641277369] [2023-12-15 21:30:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:04,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:30:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:04,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:30:04,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:30:04,188 INFO L87 Difference]: Start difference. First operand 821 states and 1094 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-12-15 21:30:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:04,355 INFO L93 Difference]: Finished difference Result 1746 states and 2323 transitions. [2023-12-15 21:30:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:30:04,356 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-12-15 21:30:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:04,358 INFO L225 Difference]: With dead ends: 1746 [2023-12-15 21:30:04,358 INFO L226 Difference]: Without dead ends: 926 [2023-12-15 21:30:04,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-12-15 21:30:04,360 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 137 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:04,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 572 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:30:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2023-12-15 21:30:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 804. [2023-12-15 21:30:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 712 states have (on average 1.2879213483146068) internal successors, (917), 715 states have internal predecessors, (917), 74 states have call successors, (74), 17 states have call predecessors, (74), 17 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-15 21:30:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1065 transitions. [2023-12-15 21:30:04,439 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1065 transitions. Word has length 121 [2023-12-15 21:30:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:04,440 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1065 transitions. [2023-12-15 21:30:04,440 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-12-15 21:30:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1065 transitions. [2023-12-15 21:30:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:30:04,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:04,441 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, 1] [2023-12-15 21:30:04,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-15 21:30:04,441 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:04,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -614941095, now seen corresponding path program 1 times [2023-12-15 21:30:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:04,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944839383] [2023-12-15 21:30:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:30:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:30:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:30:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:30:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:30:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:30:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:30:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:30:06,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944839383] [2023-12-15 21:30:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944839383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:06,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:06,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-12-15 21:30:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162977117] [2023-12-15 21:30:06,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:06,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-15 21:30:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:06,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-15 21:30:06,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-12-15 21:30:06,667 INFO L87 Difference]: Start difference. First operand 804 states and 1065 transitions. Second operand has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Received shutdown request... [2023-12-15 21:30:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-15 21:30:11,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=397, Invalid=1673, Unknown=0, NotChecked=0, Total=2070 [2023-12-15 21:30:11,825 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 415 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:11,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1648 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-15 21:30:11,826 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:30:11,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-15 21:30:11,826 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (804states) and FLOYD_HOARE automaton (currently 34 states, 21 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-10-2-5-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-10-2-4-2-1 context. [2023-12-15 21:30:11,830 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-15 21:30:11,833 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:30:11,834 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:30:11,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:30:11 BoogieIcfgContainer [2023-12-15 21:30:11,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:30:11,843 INFO L158 Benchmark]: Toolchain (without parser) took 44851.32ms. Allocated memory was 180.4MB in the beginning and 920.6MB in the end (delta: 740.3MB). Free memory was 135.8MB in the beginning and 503.6MB in the end (delta: -367.8MB). Peak memory consumption was 373.4MB. Max. memory is 8.0GB. [2023-12-15 21:30:11,845 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:30:11,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.65ms. Allocated memory is still 180.4MB. Free memory was 135.5MB in the beginning and 121.0MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:30:11,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.83ms. Allocated memory is still 180.4MB. Free memory was 121.0MB in the beginning and 117.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:30:11,846 INFO L158 Benchmark]: Boogie Preprocessor took 98.04ms. Allocated memory is still 180.4MB. Free memory was 117.3MB in the beginning and 112.4MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:30:11,846 INFO L158 Benchmark]: RCFGBuilder took 767.25ms. Allocated memory is still 180.4MB. Free memory was 112.4MB in the beginning and 141.4MB in the end (delta: -29.0MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. [2023-12-15 21:30:11,846 INFO L158 Benchmark]: TraceAbstraction took 43621.43ms. Allocated memory was 180.4MB in the beginning and 920.6MB in the end (delta: 740.3MB). Free memory was 140.9MB in the beginning and 503.6MB in the end (delta: -362.8MB). Peak memory consumption was 377.5MB. Max. memory is 8.0GB. [2023-12-15 21:30:11,847 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.65ms. Allocated memory is still 180.4MB. Free memory was 135.5MB in the beginning and 121.0MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.83ms. Allocated memory is still 180.4MB. Free memory was 121.0MB in the beginning and 117.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 98.04ms. Allocated memory is still 180.4MB. Free memory was 117.3MB in the beginning and 112.4MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 767.25ms. Allocated memory is still 180.4MB. Free memory was 112.4MB in the beginning and 141.4MB in the end (delta: -29.0MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. * TraceAbstraction took 43621.43ms. Allocated memory was 180.4MB in the beginning and 920.6MB in the end (delta: 740.3MB). Free memory was 140.9MB in the beginning and 503.6MB in the end (delta: -362.8MB). Peak memory consumption was 377.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (804states) and FLOYD_HOARE automaton (currently 34 states, 21 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-10-2-5-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-10-2-4-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 35, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9910 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9892 mSDsluCounter, 39851 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32788 mSDsCounter, 1117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11284 IncrementalHoareTripleChecker+Invalid, 12401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1117 mSolverCounterUnsat, 7063 mSDtfsCounter, 11284 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1371 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1965occurred in iteration=10, InterpolantAutomatonStates: 325, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 5265 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 4035 NumberOfCodeBlocks, 4035 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4000 ConstructedInterpolants, 0 QuantifiedInterpolants, 30128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 9240/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown