/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_BITWISE.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:54:04,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:54:04,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:54:04,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:54:04,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:54:04,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:54:04,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:54:04,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:54:04,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:54:04,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:54:04,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:54:04,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:54:04,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:54:04,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:54:04,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:54:04,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:54:04,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:54:04,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:54:04,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:54:04,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:54:04,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:54:04,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:54:04,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:54:04,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:54:04,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:54:04,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:54:04,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:54:04,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:54:04,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:54:04,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:54:04,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:54:04,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:54:04,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:54:04,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:54:04,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:54:04,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:54:04,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:54:04,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:54:04,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:54:04,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:54:04,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:54:04,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:54:04,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:54:04,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:54:04,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:54:04,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:54:04,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:54:04,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:54:04,133 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:54:04,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:54:04,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:54:04,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:54:04,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:54:04,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:54:04,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:54:04,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:54:04,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:54:04,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:54:04,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:54:04,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:54:04,136 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:54:04,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:54:04,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:54:04,136 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:54:04,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:54:04,137 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:54:04,137 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 11:54:04,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:54:04,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:54:04,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:54:04,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:54:04,350 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:54:04,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-1.i [2022-01-10 11:54:04,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c057c49cf/d97cf14c01ae41c2b34992fd3793faf7/FLAGadaa99070 [2022-01-10 11:54:04,744 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:54:04,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i [2022-01-10 11:54:04,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c057c49cf/d97cf14c01ae41c2b34992fd3793faf7/FLAGadaa99070 [2022-01-10 11:54:05,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c057c49cf/d97cf14c01ae41c2b34992fd3793faf7 [2022-01-10 11:54:05,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:54:05,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:54:05,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:54:05,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:54:05,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:54:05,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b21c6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05, skipping insertion in model container [2022-01-10 11:54:05,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:54:05,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:54:05,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22080,22093] [2022-01-10 11:54:05,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22353,22366] [2022-01-10 11:54:05,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22587,22600] [2022-01-10 11:54:05,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22657,22670] [2022-01-10 11:54:05,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22924,22937] [2022-01-10 11:54:05,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23032,23045] [2022-01-10 11:54:05,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23263,23276] [2022-01-10 11:54:05,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23343,23356] [2022-01-10 11:54:05,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23422,23435] [2022-01-10 11:54:05,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23512,23525] [2022-01-10 11:54:05,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23690,23703] [2022-01-10 11:54:05,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23768,23781] [2022-01-10 11:54:05,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23845,23858] [2022-01-10 11:54:05,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:54:05,399 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:54:05,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22080,22093] [2022-01-10 11:54:05,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22353,22366] [2022-01-10 11:54:05,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22587,22600] [2022-01-10 11:54:05,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22657,22670] [2022-01-10 11:54:05,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[22924,22937] [2022-01-10 11:54:05,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23032,23045] [2022-01-10 11:54:05,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23263,23276] [2022-01-10 11:54:05,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23343,23356] [2022-01-10 11:54:05,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23422,23435] [2022-01-10 11:54:05,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23512,23525] [2022-01-10 11:54:05,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23690,23703] [2022-01-10 11:54:05,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23768,23781] [2022-01-10 11:54:05,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-1.i[23845,23858] [2022-01-10 11:54:05,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:54:05,460 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:54:05,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05 WrapperNode [2022-01-10 11:54:05,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:54:05,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:54:05,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:54:05,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:54:05,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,505 INFO L137 Inliner]: procedures = 120, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2022-01-10 11:54:05,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:54:05,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:54:05,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:54:05,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:54:05,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:54:05,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:54:05,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:54:05,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:54:05,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (1/1) ... [2022-01-10 11:54:05,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:54:05,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:05,560 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 11:54:05,562 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 11:54:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:54:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:54:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:54:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:54:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:54:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:54:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:54:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:54:05,726 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:54:05,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:54:06,100 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:54:06,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:54:06,105 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-01-10 11:54:06,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:06 BoogieIcfgContainer [2022-01-10 11:54:06,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:54:06,107 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:54:06,107 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:54:06,108 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:54:06,110 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:54:06 BasicIcfg [2022-01-10 11:54:06,170 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:54:06,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:54:06,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:54:06,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:54:06,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:54:05" (1/4) ... [2022-01-10 11:54:06,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a46176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:54:06, skipping insertion in model container [2022-01-10 11:54:06,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:05" (2/4) ... [2022-01-10 11:54:06,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a46176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:54:06, skipping insertion in model container [2022-01-10 11:54:06,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:06" (3/4) ... [2022-01-10 11:54:06,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a46176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:54:06, skipping insertion in model container [2022-01-10 11:54:06,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:54:06" (4/4) ... [2022-01-10 11:54:06,175 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.iTransformedIcfg [2022-01-10 11:54:06,178 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:54:06,178 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-01-10 11:54:06,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:54:06,211 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 11:54:06,212 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-01-10 11:54:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 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 11:54:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-01-10 11:54:06,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:06,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-01-10 11:54:06,225 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash 10960166, now seen corresponding path program 1 times [2022-01-10 11:54:06,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:06,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085817054] [2022-01-10 11:54:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:06,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:06,383 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 11:54:06,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:06,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085817054] [2022-01-10 11:54:06,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085817054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:06,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:06,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:06,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137000315] [2022-01-10 11:54:06,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:06,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:06,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:06,407 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 11:54:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:06,449 INFO L93 Difference]: Finished difference Result 174 states and 290 transitions. [2022-01-10 11:54:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:06,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-01-10 11:54:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:06,457 INFO L225 Difference]: With dead ends: 174 [2022-01-10 11:54:06,457 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 11:54:06,459 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 11:54:06,462 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 80 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:06,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 11:54:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2022-01-10 11:54:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 73 states have internal predecessors, (83), 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 11:54:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-01-10 11:54:06,486 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 4 [2022-01-10 11:54:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:06,486 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-01-10 11:54:06,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 11:54:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-01-10 11:54:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 11:54:06,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:06,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:06,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:54:06,488 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash -212488373, now seen corresponding path program 1 times [2022-01-10 11:54:06,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:06,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358587851] [2022-01-10 11:54:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:06,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:06,532 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 11:54:06,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:06,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358587851] [2022-01-10 11:54:06,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358587851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:06,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:06,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:06,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949391881] [2022-01-10 11:54:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:06,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:06,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:06,535 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11:54:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:06,547 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-01-10 11:54:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-01-10 11:54:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:06,549 INFO L225 Difference]: With dead ends: 77 [2022-01-10 11:54:06,549 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 11:54:06,549 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 11:54:06,550 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:06,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 11:54:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-01-10 11:54:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 74 states have internal predecessors, (84), 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 11:54:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-01-10 11:54:06,556 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 9 [2022-01-10 11:54:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:06,557 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-01-10 11:54:06,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11:54:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-01-10 11:54:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 11:54:06,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:06,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:06,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:54:06,558 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash -212487412, now seen corresponding path program 1 times [2022-01-10 11:54:06,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:06,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807005077] [2022-01-10 11:54:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:06,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:06,625 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 11:54:06,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:06,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807005077] [2022-01-10 11:54:06,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807005077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:06,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:06,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:06,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110394314] [2022-01-10 11:54:06,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:06,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:06,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:06,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:06,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:06,627 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 11:54:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:06,762 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2022-01-10 11:54:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:54:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-01-10 11:54:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:06,763 INFO L225 Difference]: With dead ends: 130 [2022-01-10 11:54:06,763 INFO L226 Difference]: Without dead ends: 128 [2022-01-10 11:54:06,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:06,764 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:06,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 193 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-10 11:54:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2022-01-10 11:54:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 76 states have internal predecessors, (87), 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 11:54:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2022-01-10 11:54:06,774 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 9 [2022-01-10 11:54:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:06,774 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2022-01-10 11:54:06,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 11:54:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-01-10 11:54:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 11:54:06,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:06,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:06,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:54:06,775 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash -211563891, now seen corresponding path program 1 times [2022-01-10 11:54:06,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:06,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665705047] [2022-01-10 11:54:06,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:06,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,006 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 11:54:07,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665705047] [2022-01-10 11:54:07,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665705047] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:54:07,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200768718] [2022-01-10 11:54:07,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:54:07,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:54:07,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:54:07,011 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 11:54:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,178 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-01-10 11:54:07,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:54:07,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-01-10 11:54:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,179 INFO L225 Difference]: With dead ends: 96 [2022-01-10 11:54:07,179 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 11:54:07,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-10 11:54:07,180 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:07,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 200 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 11:54:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2022-01-10 11:54:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 71 states have internal predecessors, (81), 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 11:54:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-01-10 11:54:07,186 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 9 [2022-01-10 11:54:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,186 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-01-10 11:54:07,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 11:54:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-01-10 11:54:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 11:54:07,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:07,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 11:54:07,187 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash -377988359, now seen corresponding path program 1 times [2022-01-10 11:54:07,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61677036] [2022-01-10 11:54:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,308 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 11:54:07,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61677036] [2022-01-10 11:54:07,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61677036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:07,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337418644] [2022-01-10 11:54:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:07,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:07,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:07,318 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 11:54:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,428 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2022-01-10 11:54:07,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:54:07,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-01-10 11:54:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,429 INFO L225 Difference]: With dead ends: 189 [2022-01-10 11:54:07,430 INFO L226 Difference]: Without dead ends: 124 [2022-01-10 11:54:07,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:07,431 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 54 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:07,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 183 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-10 11:54:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2022-01-10 11:54:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 73 states have internal predecessors, (83), 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 11:54:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-01-10 11:54:07,436 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 13 [2022-01-10 11:54:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,436 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-01-10 11:54:07,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 11:54:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-01-10 11:54:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 11:54:07,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:07,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 11:54:07,437 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash 509515322, now seen corresponding path program 1 times [2022-01-10 11:54:07,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835216422] [2022-01-10 11:54:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,530 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 11:54:07,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835216422] [2022-01-10 11:54:07,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835216422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 11:54:07,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453932678] [2022-01-10 11:54:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 11:54:07,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 11:54:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:07,535 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 11:54:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,636 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-01-10 11:54:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:54:07,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-01-10 11:54:07,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,637 INFO L225 Difference]: With dead ends: 118 [2022-01-10 11:54:07,637 INFO L226 Difference]: Without dead ends: 114 [2022-01-10 11:54:07,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:54:07,638 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 142 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:07,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 150 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-10 11:54:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2022-01-10 11:54:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 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 11:54:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-01-10 11:54:07,642 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 13 [2022-01-10 11:54:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,643 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-01-10 11:54:07,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 11:54:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-01-10 11:54:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:54:07,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:07,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 11:54:07,643 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:07,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1384925702, now seen corresponding path program 1 times [2022-01-10 11:54:07,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695418942] [2022-01-10 11:54:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,689 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 11:54:07,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695418942] [2022-01-10 11:54:07,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695418942] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:07,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274363498] [2022-01-10 11:54:07,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:07,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:07,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:07,691 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 11:54:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,757 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2022-01-10 11:54:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:54:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-01-10 11:54:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,758 INFO L225 Difference]: With dead ends: 129 [2022-01-10 11:54:07,758 INFO L226 Difference]: Without dead ends: 109 [2022-01-10 11:54:07,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:07,759 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:07,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 112 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-10 11:54:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2022-01-10 11:54:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.278688524590164) internal successors, (78), 68 states have internal predecessors, (78), 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 11:54:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2022-01-10 11:54:07,764 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2022-01-10 11:54:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,764 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2022-01-10 11:54:07,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 11:54:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-01-10 11:54:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 11:54:07,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:07,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 11:54:07,765 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1026437226, now seen corresponding path program 1 times [2022-01-10 11:54:07,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472723950] [2022-01-10 11:54:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,805 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 11:54:07,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472723950] [2022-01-10 11:54:07,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472723950] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:07,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243504584] [2022-01-10 11:54:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:07,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:07,806 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 11:54:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,818 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2022-01-10 11:54:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:07,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-01-10 11:54:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,819 INFO L225 Difference]: With dead ends: 134 [2022-01-10 11:54:07,819 INFO L226 Difference]: Without dead ends: 93 [2022-01-10 11:54:07,820 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 11:54:07,820 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:07,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-10 11:54:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2022-01-10 11:54:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.28125) internal successors, (82), 71 states have internal predecessors, (82), 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 11:54:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-01-10 11:54:07,825 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 18 [2022-01-10 11:54:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,825 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-01-10 11:54:07,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 11:54:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-01-10 11:54:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 11:54:07,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:07,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 11:54:07,826 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:07,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1754750646, now seen corresponding path program 1 times [2022-01-10 11:54:07,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123907597] [2022-01-10 11:54:07,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,853 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 11:54:07,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123907597] [2022-01-10 11:54:07,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123907597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:07,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595313187] [2022-01-10 11:54:07,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:07,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:07,854 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 11:54:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,866 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-01-10 11:54:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:07,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-01-10 11:54:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,867 INFO L225 Difference]: With dead ends: 72 [2022-01-10 11:54:07,867 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 11:54:07,867 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 11:54:07,867 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:07,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 11:54:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-01-10 11:54:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 69 states have internal predecessors, (80), 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 11:54:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-01-10 11:54:07,871 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 19 [2022-01-10 11:54:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,871 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-01-10 11:54:07,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 11:54:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-01-10 11:54:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 11:54:07,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,872 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] [2022-01-10 11:54:07,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 11:54:07,872 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:07,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1942473314, now seen corresponding path program 1 times [2022-01-10 11:54:07,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479684344] [2022-01-10 11:54:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,931 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 11:54:07,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479684344] [2022-01-10 11:54:07,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479684344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:07,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30153258] [2022-01-10 11:54:07,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:07,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:07,932 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 11:54:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,943 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-01-10 11:54:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:07,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-01-10 11:54:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,944 INFO L225 Difference]: With dead ends: 73 [2022-01-10 11:54:07,944 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 11:54:07,944 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 11:54:07,945 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:07,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 11:54:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-01-10 11:54:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.265625) internal successors, (81), 70 states have internal predecessors, (81), 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 11:54:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-01-10 11:54:07,948 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 20 [2022-01-10 11:54:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,948 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-01-10 11:54:07,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 11:54:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-01-10 11:54:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 11:54:07,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,949 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] [2022-01-10 11:54:07,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 11:54:07,949 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:07,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1942474275, now seen corresponding path program 1 times [2022-01-10 11:54:07,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704471274] [2022-01-10 11:54:07,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,997 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 11:54:07,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704471274] [2022-01-10 11:54:07,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704471274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:07,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497782214] [2022-01-10 11:54:07,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:07,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:07,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:07,998 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 11:54:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,084 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2022-01-10 11:54:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:54:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-01-10 11:54:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,085 INFO L225 Difference]: With dead ends: 80 [2022-01-10 11:54:08,085 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 11:54:08,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:08,086 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:08,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 183 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 11:54:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-01-10 11:54:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 states have internal predecessors, (84), 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 11:54:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-01-10 11:54:08,089 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 20 [2022-01-10 11:54:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,089 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-01-10 11:54:08,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 11:54:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-01-10 11:54:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 11:54:08,089 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,089 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] [2022-01-10 11:54:08,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 11:54:08,090 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1943397796, now seen corresponding path program 1 times [2022-01-10 11:54:08,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556592183] [2022-01-10 11:54:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:08,192 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 11:54:08,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:08,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556592183] [2022-01-10 11:54:08,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556592183] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:08,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:08,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:08,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641328931] [2022-01-10 11:54:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:08,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:08,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:08,194 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 11:54:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,257 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-01-10 11:54:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:54:08,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-01-10 11:54:08,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,258 INFO L225 Difference]: With dead ends: 73 [2022-01-10 11:54:08,258 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 11:54:08,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:08,259 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:08,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 11:54:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-01-10 11:54:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 67 states have internal predecessors, (78), 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 11:54:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-01-10 11:54:08,263 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 20 [2022-01-10 11:54:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,263 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-01-10 11:54:08,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 11:54:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-01-10 11:54:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:54:08,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,264 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] [2022-01-10 11:54:08,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 11:54:08,264 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1728136734, now seen corresponding path program 1 times [2022-01-10 11:54:08,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571585983] [2022-01-10 11:54:08,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:08,399 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 11:54:08,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:08,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571585983] [2022-01-10 11:54:08,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571585983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:08,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:08,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:54:08,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440411620] [2022-01-10 11:54:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:08,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:54:08,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:54:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:54:08,400 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 11:54:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,643 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2022-01-10 11:54:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 11:54:08,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-01-10 11:54:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,644 INFO L225 Difference]: With dead ends: 193 [2022-01-10 11:54:08,644 INFO L226 Difference]: Without dead ends: 151 [2022-01-10 11:54:08,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 11:54:08,645 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 199 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:08,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 228 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:54:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-01-10 11:54:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 87. [2022-01-10 11:54:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 86 states have internal predecessors, (101), 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 11:54:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-01-10 11:54:08,650 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 22 [2022-01-10 11:54:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,650 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-01-10 11:54:08,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 11:54:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-01-10 11:54:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:54:08,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,651 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] [2022-01-10 11:54:08,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 11:54:08,651 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2080292386, now seen corresponding path program 1 times [2022-01-10 11:54:08,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940279820] [2022-01-10 11:54:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:09,018 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 11:54:09,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:09,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940279820] [2022-01-10 11:54:09,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940279820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:09,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:09,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 11:54:09,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315834953] [2022-01-10 11:54:09,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:09,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:54:09,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:54:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:54:09,020 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 11:54:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:09,475 INFO L93 Difference]: Finished difference Result 234 states and 262 transitions. [2022-01-10 11:54:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 11:54:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 22 [2022-01-10 11:54:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:09,477 INFO L225 Difference]: With dead ends: 234 [2022-01-10 11:54:09,477 INFO L226 Difference]: Without dead ends: 232 [2022-01-10 11:54:09,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 11:54:09,478 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 244 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:09,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 416 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 11:54:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-01-10 11:54:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 98. [2022-01-10 11:54:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 97 states have internal predecessors, (114), 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 11:54:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2022-01-10 11:54:09,484 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 22 [2022-01-10 11:54:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:09,484 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2022-01-10 11:54:09,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 11:54:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-01-10 11:54:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 11:54:09,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:09,485 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 11:54:09,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 11:54:09,485 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1571713419, now seen corresponding path program 1 times [2022-01-10 11:54:09,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:09,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017571919] [2022-01-10 11:54:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:09,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:09,520 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 11:54:09,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:09,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017571919] [2022-01-10 11:54:09,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017571919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:09,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:09,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 11:54:09,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558465357] [2022-01-10 11:54:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:09,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 11:54:09,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:09,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 11:54:09,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:09,521 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 11:54:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:09,635 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2022-01-10 11:54:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:54:09,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 11:54:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:09,636 INFO L225 Difference]: With dead ends: 146 [2022-01-10 11:54:09,636 INFO L226 Difference]: Without dead ends: 144 [2022-01-10 11:54:09,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:54:09,636 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:09,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 174 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-01-10 11:54:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 124. [2022-01-10 11:54:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 123 states have internal predecessors, (148), 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 11:54:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2022-01-10 11:54:09,660 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 24 [2022-01-10 11:54:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:09,660 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2022-01-10 11:54:09,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 11:54:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2022-01-10 11:54:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 11:54:09,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:09,662 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] [2022-01-10 11:54:09,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 11:54:09,662 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1908771830, now seen corresponding path program 1 times [2022-01-10 11:54:09,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:09,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046837426] [2022-01-10 11:54:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:09,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 11:54:09,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 11:54:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 11:54:09,770 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 11:54:09,770 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 11:54:09,771 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2022-01-10 11:54:09,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2022-01-10 11:54:09,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2022-01-10 11:54:09,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2022-01-10 11:54:09,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2022-01-10 11:54:09,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2022-01-10 11:54:09,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2022-01-10 11:54:09,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2022-01-10 11:54:09,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2022-01-10 11:54:09,773 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2022-01-10 11:54:09,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2022-01-10 11:54:09,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2022-01-10 11:54:09,774 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2022-01-10 11:54:09,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 11:54:09,776 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:09,778 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 11:54:09,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:54:09 BasicIcfg [2022-01-10 11:54:09,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 11:54:09,804 INFO L158 Benchmark]: Toolchain (without parser) took 4667.06ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 124.3MB in the beginning and 144.0MB in the end (delta: -19.7MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2022-01-10 11:54:09,804 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory was 141.8MB in the beginning and 141.7MB in the end (delta: 71.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 11:54:09,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.19ms. Allocated memory is still 173.0MB. Free memory was 124.1MB in the beginning and 141.1MB in the end (delta: -17.0MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-01-10 11:54:09,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 173.0MB. Free memory was 141.1MB in the beginning and 138.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 11:54:09,804 INFO L158 Benchmark]: Boogie Preprocessor took 22.51ms. Allocated memory is still 173.0MB. Free memory was 138.5MB in the beginning and 136.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 11:54:09,805 INFO L158 Benchmark]: RCFGBuilder took 577.20ms. Allocated memory is still 173.0MB. Free memory was 136.4MB in the beginning and 114.4MB in the end (delta: 22.1MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-01-10 11:54:09,805 INFO L158 Benchmark]: IcfgTransformer took 63.58ms. Allocated memory is still 173.0MB. Free memory was 114.4MB in the beginning and 107.1MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-10 11:54:09,805 INFO L158 Benchmark]: TraceAbstraction took 3632.29ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 106.6MB in the beginning and 144.0MB in the end (delta: -37.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 11:54:09,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory was 141.8MB in the beginning and 141.7MB in the end (delta: 71.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.19ms. Allocated memory is still 173.0MB. Free memory was 124.1MB in the beginning and 141.1MB in the end (delta: -17.0MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 173.0MB. Free memory was 141.1MB in the beginning and 138.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.51ms. Allocated memory is still 173.0MB. Free memory was 138.5MB in the beginning and 136.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 577.20ms. Allocated memory is still 173.0MB. Free memory was 136.4MB in the beginning and 114.4MB in the end (delta: 22.1MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * IcfgTransformer took 63.58ms. Allocated memory is still 173.0MB. Free memory was 114.4MB in the beginning and 107.1MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3632.29ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 106.6MB in the beginning and 144.0MB in the end (delta: -37.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) [L1005] list->prev = ((void*)0) VAL [list={-7:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-7:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner [L1006] list->inner->inner = ((void*)0) [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-7:0}, list->inner={-6:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-7:0}, list={-7:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-7:0}, list={-7:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-7:0}, list={-7:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-7:0}, inner={-6:0}, len=0, list={-7:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-7:0}, inner={-6:0}, len=1, list={-7:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-7:0}, inner={-6:0}, len=1, list={-7:0}] [L1039] EXPR inner->inner VAL [end={-7:0}, inner={-6:0}, inner->inner={0:0}, len=1, list={-7:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-7:0}, inner={-6:0}, inner->next={0:0}, len=1, list={-7:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-7:0}, inner={-6:0}, len=1, list={-7:0}] - UnprovableResult [Line: 1006]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1149 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1149 mSDsluCounter, 2674 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1659 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 836 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1015 mSDtfsCounter, 836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=15, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 472 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 2211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 11:54:09,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...