/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:53:13,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:53:13,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:53:13,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:53:13,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:53:13,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:53:13,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:53:13,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:53:13,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:53:13,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:53:13,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:53:13,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:53:13,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:53:13,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:53:13,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:53:13,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:53:13,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:53:13,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:53:13,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:53:13,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:53:13,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:53:13,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:53:13,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:53:13,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:53:13,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:53:13,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:53:13,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:53:13,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:53:13,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:53:13,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:53:13,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:53:13,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:53:13,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:53:13,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:53:13,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:53:13,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:53:13,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:53:13,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:53:13,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:53:13,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:53:13,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:53:13,466 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 15:53:13,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:53:13,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:53:13,483 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:53:13,483 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:53:13,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:53:13,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:53:13,484 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:53:13,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:53:13,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:53:13,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:53:13,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:53:13,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:53:13,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:53:13,485 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:53:13,485 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:53:13,487 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:53:13,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:53:13,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:53:13,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:53:13,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:53:13,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:53:13,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:53:13,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:53:13,490 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:53:13,490 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 15:53:13,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:53:13,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:53:13,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:53:13,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:53:13,732 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:53:13,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c [2022-01-10 15:53:13,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86081e0a8/bdb8c806a4c747bdba431b7e3c21e10c/FLAGab5ff86dd [2022-01-10 15:53:14,326 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:53:14,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c [2022-01-10 15:53:14,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86081e0a8/bdb8c806a4c747bdba431b7e3c21e10c/FLAGab5ff86dd [2022-01-10 15:53:14,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86081e0a8/bdb8c806a4c747bdba431b7e3c21e10c [2022-01-10 15:53:14,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:53:14,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:53:14,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:53:14,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:53:14,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:53:14,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:14" (1/1) ... [2022-01-10 15:53:14,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73add5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:14, skipping insertion in model container [2022-01-10 15:53:14,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:14" (1/1) ... [2022-01-10 15:53:14,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:53:14,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:53:15,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-01-10 15:53:15,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:53:15,401 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 15:53:15,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:53:15,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-01-10 15:53:15,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:53:15,547 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:53:15,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-01-10 15:53:15,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:53:15,706 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:53:15,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15 WrapperNode [2022-01-10 15:53:15,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:53:15,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:53:15,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:53:15,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:53:15,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,814 INFO L137 Inliner]: procedures = 117, calls = 328, calls flagged for inlining = 52, calls inlined = 89, statements flattened = 1772 [2022-01-10 15:53:15,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:53:15,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:53:15,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:53:15,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:53:15,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:53:15,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:53:15,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:53:15,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:53:15,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (1/1) ... [2022-01-10 15:53:15,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:53:15,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:53:15,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 15:53:15,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:53:15,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-01-10 15:53:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:53:15,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:53:16,236 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:53:16,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:53:16,242 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,243 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,244 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,247 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,250 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,253 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,255 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,256 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,258 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,265 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,267 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,268 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,269 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:16,278 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:53:27,445 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##428: assume !false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##201: assume !false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##200: assume false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##289: assume !false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##231: assume !false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##230: assume false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume !false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##318: assume false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##173: assume false; [2022-01-10 15:53:27,446 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume !false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##69: assume !false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##36: assume !false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##341: assume !false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##340: assume false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##114: assume !false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume false; [2022-01-10 15:53:27,447 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##360: assume false; [2022-01-10 15:53:27,448 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##361: assume !false; [2022-01-10 15:53:27,448 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:53:27,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:53:27,456 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 15:53:27,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:27 BoogieIcfgContainer [2022-01-10 15:53:27,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:53:27,460 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:53:27,460 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:53:27,465 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:53:27,467 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:27" (1/1) ... [2022-01-10 15:53:27,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:53:27 BasicIcfg [2022-01-10 15:53:27,809 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:53:27,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:53:27,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:53:27,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:53:27,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:53:14" (1/4) ... [2022-01-10 15:53:27,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181632a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:27, skipping insertion in model container [2022-01-10 15:53:27,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:15" (2/4) ... [2022-01-10 15:53:27,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181632a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:27, skipping insertion in model container [2022-01-10 15:53:27,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:27" (3/4) ... [2022-01-10 15:53:27,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181632a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:53:27, skipping insertion in model container [2022-01-10 15:53:27,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:53:27" (4/4) ... [2022-01-10 15:53:27,817 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.cTransformedIcfg [2022-01-10 15:53:27,821 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:53:27,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-01-10 15:53:27,888 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:53:27,893 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 15:53:27,894 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-01-10 15:53:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 370 states have (on average 1.5621621621621622) internal successors, (578), 400 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 15:53:27,918 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:27,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:27,919 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2053233023, now seen corresponding path program 1 times [2022-01-10 15:53:27,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:27,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216270176] [2022-01-10 15:53:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:27,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:28,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:28,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216270176] [2022-01-10 15:53:28,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216270176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:28,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:28,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:53:28,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100007512] [2022-01-10 15:53:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:28,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 15:53:28,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 15:53:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 15:53:28,454 INFO L87 Difference]: Start difference. First operand has 401 states, 370 states have (on average 1.5621621621621622) internal successors, (578), 400 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:28,494 INFO L93 Difference]: Finished difference Result 768 states and 1121 transitions. [2022-01-10 15:53:28,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 15:53:28,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 15:53:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:28,523 INFO L225 Difference]: With dead ends: 768 [2022-01-10 15:53:28,524 INFO L226 Difference]: Without dead ends: 365 [2022-01-10 15:53:28,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 15:53:28,530 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:28,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-01-10 15:53:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-01-10 15:53:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 335 states have (on average 1.4865671641791045) internal successors, (498), 364 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 498 transitions. [2022-01-10 15:53:28,586 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 498 transitions. Word has length 15 [2022-01-10 15:53:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:28,586 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 498 transitions. [2022-01-10 15:53:28,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 498 transitions. [2022-01-10 15:53:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 15:53:28,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:28,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:28,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:53:28,587 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1924150304, now seen corresponding path program 1 times [2022-01-10 15:53:28,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:28,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615997271] [2022-01-10 15:53:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:28,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:28,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:28,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615997271] [2022-01-10 15:53:28,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615997271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:28,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:28,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:28,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671689290] [2022-01-10 15:53:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:28,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:28,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:28,904 INFO L87 Difference]: Start difference. First operand 365 states and 498 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:29,715 INFO L93 Difference]: Finished difference Result 382 states and 518 transitions. [2022-01-10 15:53:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:29,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 15:53:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:29,718 INFO L225 Difference]: With dead ends: 382 [2022-01-10 15:53:29,718 INFO L226 Difference]: Without dead ends: 365 [2022-01-10 15:53:29,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:29,719 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 4 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:29,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 870 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 15:53:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-01-10 15:53:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-01-10 15:53:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 335 states have (on average 1.483582089552239) internal successors, (497), 364 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 497 transitions. [2022-01-10 15:53:29,730 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 497 transitions. Word has length 15 [2022-01-10 15:53:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:29,730 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 497 transitions. [2022-01-10 15:53:29,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 497 transitions. [2022-01-10 15:53:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 15:53:29,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:29,732 INFO L514 BasicCegarLoop]: trace 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] [2022-01-10 15:53:29,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:53:29,732 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1158541239, now seen corresponding path program 1 times [2022-01-10 15:53:29,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:29,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801602536] [2022-01-10 15:53:29,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:29,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:30,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:30,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801602536] [2022-01-10 15:53:30,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801602536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:30,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:30,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:30,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595627659] [2022-01-10 15:53:30,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:30,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:30,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:30,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:30,111 INFO L87 Difference]: Start difference. First operand 365 states and 497 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:32,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:32,782 INFO L93 Difference]: Finished difference Result 474 states and 634 transitions. [2022-01-10 15:53:32,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:32,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 15:53:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:32,785 INFO L225 Difference]: With dead ends: 474 [2022-01-10 15:53:32,785 INFO L226 Difference]: Without dead ends: 408 [2022-01-10 15:53:32,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:32,786 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 245 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:32,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 680 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 122 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 15:53:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-01-10 15:53:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 391. [2022-01-10 15:53:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 371 states have (on average 1.4393530997304582) internal successors, (534), 390 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 534 transitions. [2022-01-10 15:53:32,809 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 534 transitions. Word has length 24 [2022-01-10 15:53:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:32,809 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 534 transitions. [2022-01-10 15:53:32,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 534 transitions. [2022-01-10 15:53:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 15:53:32,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:32,810 INFO L514 BasicCegarLoop]: trace 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] [2022-01-10 15:53:32,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:53:32,811 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:32,811 INFO L85 PathProgramCache]: Analyzing trace with hash -587398148, now seen corresponding path program 1 times [2022-01-10 15:53:32,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:32,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156668941] [2022-01-10 15:53:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:32,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:33,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:33,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156668941] [2022-01-10 15:53:33,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156668941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:33,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:33,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:33,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575750799] [2022-01-10 15:53:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:33,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:33,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:33,180 INFO L87 Difference]: Start difference. First operand 391 states and 534 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:35,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:35,241 INFO L93 Difference]: Finished difference Result 477 states and 650 transitions. [2022-01-10 15:53:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:35,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 15:53:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:35,242 INFO L225 Difference]: With dead ends: 477 [2022-01-10 15:53:35,242 INFO L226 Difference]: Without dead ends: 392 [2022-01-10 15:53:35,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:35,244 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 0 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:35,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 948 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-01-10 15:53:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-01-10 15:53:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-01-10 15:53:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 372 states have (on average 1.4381720430107527) internal successors, (535), 391 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 535 transitions. [2022-01-10 15:53:35,254 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 535 transitions. Word has length 29 [2022-01-10 15:53:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:35,254 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 535 transitions. [2022-01-10 15:53:35,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 535 transitions. [2022-01-10 15:53:35,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 15:53:35,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:35,256 INFO L514 BasicCegarLoop]: trace 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] [2022-01-10 15:53:35,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:53:35,256 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:35,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash -371708796, now seen corresponding path program 1 times [2022-01-10 15:53:35,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:35,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329821873] [2022-01-10 15:53:35,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:35,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:35,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:35,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329821873] [2022-01-10 15:53:35,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329821873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:35,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:35,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:35,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379556601] [2022-01-10 15:53:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:35,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:35,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:35,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:35,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:35,548 INFO L87 Difference]: Start difference. First operand 392 states and 535 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:35,681 INFO L93 Difference]: Finished difference Result 589 states and 788 transitions. [2022-01-10 15:53:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:35,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 15:53:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:35,684 INFO L225 Difference]: With dead ends: 589 [2022-01-10 15:53:35,684 INFO L226 Difference]: Without dead ends: 395 [2022-01-10 15:53:35,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:35,689 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 380 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:35,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 478 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:53:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-01-10 15:53:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 341. [2022-01-10 15:53:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 329 states have (on average 1.4285714285714286) internal successors, (470), 340 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 470 transitions. [2022-01-10 15:53:35,703 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 470 transitions. Word has length 30 [2022-01-10 15:53:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:35,703 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 470 transitions. [2022-01-10 15:53:35,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 470 transitions. [2022-01-10 15:53:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 15:53:35,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:35,708 INFO L514 BasicCegarLoop]: trace 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] [2022-01-10 15:53:35,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:53:35,709 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:35,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2015887519, now seen corresponding path program 1 times [2022-01-10 15:53:35,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:35,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525203587] [2022-01-10 15:53:35,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:35,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:36,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:36,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525203587] [2022-01-10 15:53:36,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525203587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:36,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:36,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:36,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704462167] [2022-01-10 15:53:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:36,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:36,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:36,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:36,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:36,001 INFO L87 Difference]: Start difference. First operand 341 states and 470 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:38,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:38,689 INFO L93 Difference]: Finished difference Result 341 states and 470 transitions. [2022-01-10 15:53:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:38,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 15:53:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:38,692 INFO L225 Difference]: With dead ends: 341 [2022-01-10 15:53:38,692 INFO L226 Difference]: Without dead ends: 327 [2022-01-10 15:53:38,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:38,693 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 78 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:38,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 610 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-01-10 15:53:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-01-10 15:53:38,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2022-01-10 15:53:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 322 states have (on average 1.4161490683229814) internal successors, (456), 326 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 456 transitions. [2022-01-10 15:53:38,701 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 456 transitions. Word has length 31 [2022-01-10 15:53:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:38,701 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 456 transitions. [2022-01-10 15:53:38,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 456 transitions. [2022-01-10 15:53:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 15:53:38,702 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:38,702 INFO L514 BasicCegarLoop]: trace 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] [2022-01-10 15:53:38,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:53:38,702 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1528378593, now seen corresponding path program 1 times [2022-01-10 15:53:38,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:38,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521584463] [2022-01-10 15:53:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:38,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:38,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:38,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521584463] [2022-01-10 15:53:38,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521584463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:38,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:38,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:38,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306317921] [2022-01-10 15:53:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:38,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:38,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:38,981 INFO L87 Difference]: Start difference. First operand 327 states and 456 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:39,037 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2022-01-10 15:53:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:39,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 15:53:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:39,040 INFO L225 Difference]: With dead ends: 338 [2022-01-10 15:53:39,041 INFO L226 Difference]: Without dead ends: 322 [2022-01-10 15:53:39,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:39,042 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 382 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:39,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 388 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-10 15:53:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 297. [2022-01-10 15:53:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.4436860068259385) internal successors, (423), 296 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 423 transitions. [2022-01-10 15:53:39,052 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 423 transitions. Word has length 31 [2022-01-10 15:53:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:39,053 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 423 transitions. [2022-01-10 15:53:39,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 423 transitions. [2022-01-10 15:53:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 15:53:39,054 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:39,054 INFO L514 BasicCegarLoop]: trace 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] [2022-01-10 15:53:39,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:53:39,054 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash -135062874, now seen corresponding path program 1 times [2022-01-10 15:53:39,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:39,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078111577] [2022-01-10 15:53:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:39,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:39,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:39,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078111577] [2022-01-10 15:53:39,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078111577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:39,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:39,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:53:39,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183530077] [2022-01-10 15:53:39,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:39,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:53:39,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:39,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:53:39,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:53:39,337 INFO L87 Difference]: Start difference. First operand 297 states and 423 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:41,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:41,567 INFO L93 Difference]: Finished difference Result 311 states and 439 transitions. [2022-01-10 15:53:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:53:41,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 15:53:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:41,569 INFO L225 Difference]: With dead ends: 311 [2022-01-10 15:53:41,569 INFO L226 Difference]: Without dead ends: 297 [2022-01-10 15:53:41,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:41,570 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 19 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:41,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1153 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:53:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-01-10 15:53:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-01-10 15:53:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.4402730375426622) internal successors, (422), 296 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 422 transitions. [2022-01-10 15:53:41,578 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 422 transitions. Word has length 32 [2022-01-10 15:53:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:41,578 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 422 transitions. [2022-01-10 15:53:41,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 422 transitions. [2022-01-10 15:53:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 15:53:41,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:41,579 INFO L514 BasicCegarLoop]: trace 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] [2022-01-10 15:53:41,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:53:41,579 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash 762139397, now seen corresponding path program 1 times [2022-01-10 15:53:41,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:41,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070495204] [2022-01-10 15:53:41,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:41,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:41,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:41,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070495204] [2022-01-10 15:53:41,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070495204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:41,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:41,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:53:41,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031136505] [2022-01-10 15:53:41,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:41,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:53:41,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:41,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:53:41,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:53:41,873 INFO L87 Difference]: Start difference. First operand 297 states and 422 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:43,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:44,193 INFO L93 Difference]: Finished difference Result 311 states and 438 transitions. [2022-01-10 15:53:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:53:44,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 15:53:44,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:44,195 INFO L225 Difference]: With dead ends: 311 [2022-01-10 15:53:44,195 INFO L226 Difference]: Without dead ends: 297 [2022-01-10 15:53:44,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:44,196 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 7 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:44,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 1152 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-10 15:53:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-01-10 15:53:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-01-10 15:53:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.4368600682593857) internal successors, (421), 296 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 421 transitions. [2022-01-10 15:53:44,206 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 421 transitions. Word has length 33 [2022-01-10 15:53:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:44,206 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 421 transitions. [2022-01-10 15:53:44,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 421 transitions. [2022-01-10 15:53:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 15:53:44,208 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:44,208 INFO L514 BasicCegarLoop]: trace 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] [2022-01-10 15:53:44,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:53:44,208 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:44,209 INFO L85 PathProgramCache]: Analyzing trace with hash 891222116, now seen corresponding path program 1 times [2022-01-10 15:53:44,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:44,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242622183] [2022-01-10 15:53:44,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:44,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:44,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:44,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242622183] [2022-01-10 15:53:44,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242622183] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:44,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:44,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:53:44,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835102500] [2022-01-10 15:53:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:44,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:53:44,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:44,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:53:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:53:44,603 INFO L87 Difference]: Start difference. First operand 297 states and 421 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:45,391 INFO L93 Difference]: Finished difference Result 337 states and 462 transitions. [2022-01-10 15:53:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:53:45,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 15:53:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:45,393 INFO L225 Difference]: With dead ends: 337 [2022-01-10 15:53:45,393 INFO L226 Difference]: Without dead ends: 295 [2022-01-10 15:53:45,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:45,394 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 616 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:45,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 500 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 15:53:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-01-10 15:53:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-01-10 15:53:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 289 states have (on average 1.4152249134948096) internal successors, (409), 292 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 409 transitions. [2022-01-10 15:53:45,404 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 409 transitions. Word has length 33 [2022-01-10 15:53:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:45,404 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 409 transitions. [2022-01-10 15:53:45,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 409 transitions. [2022-01-10 15:53:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 15:53:45,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:45,404 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1] [2022-01-10 15:53:45,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:53:45,405 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1176791818, now seen corresponding path program 1 times [2022-01-10 15:53:45,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:45,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594796099] [2022-01-10 15:53:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:45,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:45,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:45,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594796099] [2022-01-10 15:53:45,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594796099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:45,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:45,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 15:53:45,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396490375] [2022-01-10 15:53:45,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:45,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 15:53:45,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 15:53:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:45,802 INFO L87 Difference]: Start difference. First operand 293 states and 409 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:47,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:49,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:51,971 INFO L93 Difference]: Finished difference Result 337 states and 463 transitions. [2022-01-10 15:53:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 15:53:51,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-01-10 15:53:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:51,973 INFO L225 Difference]: With dead ends: 337 [2022-01-10 15:53:51,973 INFO L226 Difference]: Without dead ends: 292 [2022-01-10 15:53:51,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 15:53:51,974 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 34 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:51,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1476 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-01-10 15:53:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-10 15:53:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-01-10 15:53:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 288 states have (on average 1.4027777777777777) internal successors, (404), 291 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 404 transitions. [2022-01-10 15:53:51,988 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 404 transitions. Word has length 40 [2022-01-10 15:53:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:51,988 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 404 transitions. [2022-01-10 15:53:51,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 404 transitions. [2022-01-10 15:53:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 15:53:51,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:51,989 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:51,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:53:51,989 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 666581440, now seen corresponding path program 1 times [2022-01-10 15:53:51,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:51,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477118578] [2022-01-10 15:53:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:51,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 15:53:52,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:52,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477118578] [2022-01-10 15:53:52,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477118578] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:52,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:52,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:53:52,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313395533] [2022-01-10 15:53:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:52,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:53:52,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:53:52,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:53:52,302 INFO L87 Difference]: Start difference. First operand 292 states and 404 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:54,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:54,402 INFO L93 Difference]: Finished difference Result 385 states and 526 transitions. [2022-01-10 15:53:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:53:54,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-01-10 15:53:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:54,404 INFO L225 Difference]: With dead ends: 385 [2022-01-10 15:53:54,404 INFO L226 Difference]: Without dead ends: 308 [2022-01-10 15:53:54,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:54,404 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 75 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:54,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 1081 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-01-10 15:53:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-01-10 15:53:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 293. [2022-01-10 15:53:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 289 states have (on average 1.4013840830449826) internal successors, (405), 292 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 405 transitions. [2022-01-10 15:53:54,414 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 405 transitions. Word has length 41 [2022-01-10 15:53:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:54,414 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 405 transitions. [2022-01-10 15:53:54,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:54,414 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 405 transitions. [2022-01-10 15:53:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 15:53:54,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:54,415 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:54,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 15:53:54,415 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:54,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1284899650, now seen corresponding path program 1 times [2022-01-10 15:53:54,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:54,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605316506] [2022-01-10 15:53:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:54,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:54,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:54,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605316506] [2022-01-10 15:53:54,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605316506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:54,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:54,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:53:54,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055933874] [2022-01-10 15:53:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:54,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:53:54,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:53:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:53:54,730 INFO L87 Difference]: Start difference. First operand 293 states and 405 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:55,325 INFO L93 Difference]: Finished difference Result 311 states and 425 transitions. [2022-01-10 15:53:55,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:53:55,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-01-10 15:53:55,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:55,327 INFO L225 Difference]: With dead ends: 311 [2022-01-10 15:53:55,327 INFO L226 Difference]: Without dead ends: 306 [2022-01-10 15:53:55,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:55,327 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 370 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:55,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 643 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 15:53:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-01-10 15:53:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2022-01-10 15:53:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 298 states have (on average 1.3926174496644295) internal successors, (415), 301 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 415 transitions. [2022-01-10 15:53:55,339 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 415 transitions. Word has length 41 [2022-01-10 15:53:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:55,339 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 415 transitions. [2022-01-10 15:53:55,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 415 transitions. [2022-01-10 15:53:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 15:53:55,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:55,340 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:55,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 15:53:55,340 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1656049441, now seen corresponding path program 1 times [2022-01-10 15:53:55,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:55,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763427038] [2022-01-10 15:53:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:55,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:55,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:55,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763427038] [2022-01-10 15:53:55,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763427038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:55,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:55,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:53:55,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739114934] [2022-01-10 15:53:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:55,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:53:55,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:53:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:53:55,660 INFO L87 Difference]: Start difference. First operand 302 states and 415 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:57,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:53:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:58,384 INFO L93 Difference]: Finished difference Result 362 states and 483 transitions. [2022-01-10 15:53:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:53:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 15:53:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:58,386 INFO L225 Difference]: With dead ends: 362 [2022-01-10 15:53:58,386 INFO L226 Difference]: Without dead ends: 357 [2022-01-10 15:53:58,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:53:58,387 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 441 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:58,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 649 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-01-10 15:53:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-01-10 15:53:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2022-01-10 15:53:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 318 states have (on average 1.3679245283018868) internal successors, (435), 321 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 435 transitions. [2022-01-10 15:53:58,410 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 435 transitions. Word has length 42 [2022-01-10 15:53:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:58,410 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 435 transitions. [2022-01-10 15:53:58,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 435 transitions. [2022-01-10 15:53:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 15:53:58,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:58,411 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:58,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 15:53:58,412 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:53:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1400229711, now seen corresponding path program 1 times [2022-01-10 15:53:58,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:58,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432499994] [2022-01-10 15:53:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:58,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 15:53:58,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:58,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432499994] [2022-01-10 15:53:58,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432499994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:58,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:58,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:58,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074867537] [2022-01-10 15:53:58,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:58,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:58,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:58,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:58,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:58,671 INFO L87 Difference]: Start difference. First operand 322 states and 435 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:00,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:54:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:54:00,897 INFO L93 Difference]: Finished difference Result 386 states and 513 transitions. [2022-01-10 15:54:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:54:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 15:54:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:54:00,899 INFO L225 Difference]: With dead ends: 386 [2022-01-10 15:54:00,899 INFO L226 Difference]: Without dead ends: 337 [2022-01-10 15:54:00,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:54:00,901 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 66 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:54:00,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 694 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 15:54:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-01-10 15:54:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 322. [2022-01-10 15:54:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 318 states have (on average 1.3647798742138364) internal successors, (434), 321 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 434 transitions. [2022-01-10 15:54:00,916 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 434 transitions. Word has length 42 [2022-01-10 15:54:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:54:00,916 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 434 transitions. [2022-01-10 15:54:00,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 434 transitions. [2022-01-10 15:54:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 15:54:00,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:54:00,917 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:54:00,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 15:54:00,917 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:54:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:54:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1207902574, now seen corresponding path program 1 times [2022-01-10 15:54:00,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:54:00,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216908603] [2022-01-10 15:54:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:54:00,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:54:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:54:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:54:01,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:54:01,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216908603] [2022-01-10 15:54:01,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216908603] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:54:01,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:54:01,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:54:01,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785605429] [2022-01-10 15:54:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:54:01,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:54:01,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:54:01,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:54:01,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:54:01,208 INFO L87 Difference]: Start difference. First operand 322 states and 434 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:54:01,743 INFO L93 Difference]: Finished difference Result 340 states and 453 transitions. [2022-01-10 15:54:01,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:54:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 15:54:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:54:01,745 INFO L225 Difference]: With dead ends: 340 [2022-01-10 15:54:01,745 INFO L226 Difference]: Without dead ends: 335 [2022-01-10 15:54:01,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:54:01,745 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 366 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 15:54:01,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 642 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 15:54:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-01-10 15:54:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2022-01-10 15:54:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 331 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 445 transitions. [2022-01-10 15:54:01,765 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 445 transitions. Word has length 42 [2022-01-10 15:54:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:54:01,765 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 445 transitions. [2022-01-10 15:54:01,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 445 transitions. [2022-01-10 15:54:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 15:54:01,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:54:01,766 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:54:01,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 15:54:01,766 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:54:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:54:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 171355793, now seen corresponding path program 1 times [2022-01-10 15:54:01,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:54:01,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663259469] [2022-01-10 15:54:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:54:01,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:54:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:54:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:54:02,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:54:02,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663259469] [2022-01-10 15:54:02,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663259469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:54:02,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:54:02,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:54:02,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253804404] [2022-01-10 15:54:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:54:02,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:54:02,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:54:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:54:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:54:02,114 INFO L87 Difference]: Start difference. First operand 332 states and 445 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:04,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:54:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:54:04,665 INFO L93 Difference]: Finished difference Result 360 states and 480 transitions. [2022-01-10 15:54:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:54:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-10 15:54:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:54:04,667 INFO L225 Difference]: With dead ends: 360 [2022-01-10 15:54:04,667 INFO L226 Difference]: Without dead ends: 322 [2022-01-10 15:54:04,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:54:04,667 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 432 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-10 15:54:04,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 655 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-01-10 15:54:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-10 15:54:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 302. [2022-01-10 15:54:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 298 states have (on average 1.3624161073825503) internal successors, (406), 301 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 406 transitions. [2022-01-10 15:54:04,681 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 406 transitions. Word has length 43 [2022-01-10 15:54:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:54:04,681 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 406 transitions. [2022-01-10 15:54:04,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 406 transitions. [2022-01-10 15:54:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 15:54:04,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:54:04,682 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:54:04,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 15:54:04,682 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:54:04,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:54:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash -680219143, now seen corresponding path program 1 times [2022-01-10 15:54:04,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:54:04,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48503392] [2022-01-10 15:54:04,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:54:04,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:54:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:54:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 15:54:04,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:54:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48503392] [2022-01-10 15:54:04,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48503392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:54:04,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:54:04,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:54:04,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626078734] [2022-01-10 15:54:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:54:04,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:54:04,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:54:04,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:54:04,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:54:04,926 INFO L87 Difference]: Start difference. First operand 302 states and 406 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:06,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:54:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:54:07,367 INFO L93 Difference]: Finished difference Result 345 states and 459 transitions. [2022-01-10 15:54:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:54:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-10 15:54:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:54:07,368 INFO L225 Difference]: With dead ends: 345 [2022-01-10 15:54:07,368 INFO L226 Difference]: Without dead ends: 299 [2022-01-10 15:54:07,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:54:07,369 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 6 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:54:07,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 654 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-10 15:54:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-01-10 15:54:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-01-10 15:54:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 296 states have (on average 1.3581081081081081) internal successors, (402), 298 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 402 transitions. [2022-01-10 15:54:07,382 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 402 transitions. Word has length 43 [2022-01-10 15:54:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:54:07,382 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 402 transitions. [2022-01-10 15:54:07,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 402 transitions. [2022-01-10 15:54:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 15:54:07,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:54:07,383 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:54:07,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 15:54:07,383 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:54:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:54:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1185471429, now seen corresponding path program 1 times [2022-01-10 15:54:07,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:54:07,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691523511] [2022-01-10 15:54:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:54:07,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:54:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:54:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:54:07,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:54:07,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691523511] [2022-01-10 15:54:07,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691523511] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:54:07,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:54:07,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:54:07,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067563647] [2022-01-10 15:54:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:54:07,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:54:07,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:54:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:54:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:54:07,613 INFO L87 Difference]: Start difference. First operand 299 states and 402 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:54:07,634 INFO L93 Difference]: Finished difference Result 325 states and 429 transitions. [2022-01-10 15:54:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:54:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-01-10 15:54:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:54:07,635 INFO L225 Difference]: With dead ends: 325 [2022-01-10 15:54:07,635 INFO L226 Difference]: Without dead ends: 309 [2022-01-10 15:54:07,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:54:07,636 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 58 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:54:07,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 675 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:54:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-01-10 15:54:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 296. [2022-01-10 15:54:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 293 states have (on average 1.3583617747440273) internal successors, (398), 295 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 398 transitions. [2022-01-10 15:54:07,650 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 398 transitions. Word has length 43 [2022-01-10 15:54:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:54:07,650 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 398 transitions. [2022-01-10 15:54:07,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 398 transitions. [2022-01-10 15:54:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 15:54:07,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:54:07,650 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:54:07,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 15:54:07,651 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:54:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:54:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash -215754486, now seen corresponding path program 1 times [2022-01-10 15:54:07,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:54:07,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184657907] [2022-01-10 15:54:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:54:07,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:54:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:54:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:54:07,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:54:07,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184657907] [2022-01-10 15:54:07,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184657907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:54:07,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:54:07,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:54:07,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687558374] [2022-01-10 15:54:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:54:07,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:54:07,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:54:07,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:54:07,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:54:07,852 INFO L87 Difference]: Start difference. First operand 296 states and 398 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:09,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:54:12,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:54:14,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:54:16,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:54:18,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 15:54:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:54:18,889 INFO L93 Difference]: Finished difference Result 469 states and 608 transitions. [2022-01-10 15:54:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:54:18,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 15:54:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:54:18,904 INFO L225 Difference]: With dead ends: 469 [2022-01-10 15:54:18,904 INFO L226 Difference]: Without dead ends: 394 [2022-01-10 15:54:18,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:54:18,907 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 87 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:54:18,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 647 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 11.0s Time] [2022-01-10 15:54:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-01-10 15:54:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 311. [2022-01-10 15:54:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 308 states have (on average 1.344155844155844) internal successors, (414), 310 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 414 transitions. [2022-01-10 15:54:18,927 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 414 transitions. Word has length 44 [2022-01-10 15:54:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:54:18,927 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 414 transitions. [2022-01-10 15:54:18,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:54:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 414 transitions. [2022-01-10 15:54:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 15:54:18,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:54:18,928 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:54:18,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 15:54:18,928 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 15:54:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:54:18,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2006152341, now seen corresponding path program 1 times [2022-01-10 15:54:18,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:54:18,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796786591] [2022-01-10 15:54:18,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:54:18,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:54:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:54:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:54:19,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:54:19,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796786591] [2022-01-10 15:54:19,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796786591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:54:19,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:54:19,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:54:19,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561147145] [2022-01-10 15:54:19,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:54:19,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:54:19,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:54:19,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:54:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:54:19,256 INFO L87 Difference]: Start difference. First operand 311 states and 414 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)