/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 05:19:06,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 05:19:06,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 05:19:06,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 05:19:06,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 05:19:06,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 05:19:06,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 05:19:06,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 05:19:06,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 05:19:06,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 05:19:06,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 05:19:06,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 05:19:06,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 05:19:06,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 05:19:06,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 05:19:06,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 05:19:06,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 05:19:06,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 05:19:06,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 05:19:06,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 05:19:06,321 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 05:19:06,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 05:19:06,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 05:19:06,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 05:19:06,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 05:19:06,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 05:19:06,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 05:19:06,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 05:19:06,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 05:19:06,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 05:19:06,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 05:19:06,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 05:19:06,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 05:19:06,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 05:19:06,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 05:19:06,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 05:19:06,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 05:19:06,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 05:19:06,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 05:19:06,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 05:19:06,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 05:19:06,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 05:19:06,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 05:19:06,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 05:19:06,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 05:19:06,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 05:19:06,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 05:19:06,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 05:19:06,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 05:19:06,357 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 05:19:06,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 05:19:06,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 05:19:06,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 05:19:06,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 05:19:06,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 05:19:06,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 05:19:06,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 05:19:06,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 05:19:06,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 05:19:06,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 05:19:06,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 05:19:06,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 05:19:06,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:19:06,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 05:19:06,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 05:19:06,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 05:19:06,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 05:19:06,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 05:19:06,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 05:19:06,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 05:19:06,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 05:19:06,361 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 05:19:06,361 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-05 05:19:06,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 05:19:06,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 05:19:06,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 05:19:06,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 05:19:06,564 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 05:19:06,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-04-05 05:19:06,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77278fada/072be90d917349de918c599d93683271/FLAG1b93d9dae [2022-04-05 05:19:06,981 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 05:19:06,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-04-05 05:19:06,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77278fada/072be90d917349de918c599d93683271/FLAG1b93d9dae [2022-04-05 05:19:07,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77278fada/072be90d917349de918c599d93683271 [2022-04-05 05:19:07,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 05:19:07,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 05:19:07,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 05:19:07,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 05:19:07,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 05:19:07,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ab8e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07, skipping insertion in model container [2022-04-05 05:19:07,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 05:19:07,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 05:19:07,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-04-05 05:19:07,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-04-05 05:19:07,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-04-05 05:19:07,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-04-05 05:19:07,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-04-05 05:19:07,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-04-05 05:19:07,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-04-05 05:19:07,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-04-05 05:19:07,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-04-05 05:19:07,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-04-05 05:19:07,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-04-05 05:19:07,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-04-05 05:19:07,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-04-05 05:19:07,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-04-05 05:19:07,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-04-05 05:19:07,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-04-05 05:19:07,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-04-05 05:19:07,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:19:07,252 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 05:19:07,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-04-05 05:19:07,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-04-05 05:19:07,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-04-05 05:19:07,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-04-05 05:19:07,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-04-05 05:19:07,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-04-05 05:19:07,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-04-05 05:19:07,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-04-05 05:19:07,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-04-05 05:19:07,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-04-05 05:19:07,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-04-05 05:19:07,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-04-05 05:19:07,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-04-05 05:19:07,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-04-05 05:19:07,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-04-05 05:19:07,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-04-05 05:19:07,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-04-05 05:19:07,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:19:07,301 INFO L208 MainTranslator]: Completed translation [2022-04-05 05:19:07,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07 WrapperNode [2022-04-05 05:19:07,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 05:19:07,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 05:19:07,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 05:19:07,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 05:19:07,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 05:19:07,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 05:19:07,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 05:19:07,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 05:19:07,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:19:07,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:19:07,365 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-04-05 05:19:07,366 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-04-05 05:19:07,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 05:19:07,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 05:19:07,389 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 05:19:07,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 05:19:07,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 05:19:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 05:19:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 05:19:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 05:19:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 05:19:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 05:19:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 05:19:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 05:19:07,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 05:19:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 05:19:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 05:19:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 05:19:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 05:19:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 05:19:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 05:19:07,446 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 05:19:07,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 05:19:07,634 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 05:19:07,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 05:19:07,638 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-05 05:19:07,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:19:07 BoogieIcfgContainer [2022-04-05 05:19:07,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 05:19:07,639 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 05:19:07,640 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 05:19:07,640 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 05:19:07,642 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:19:07" (1/1) ... [2022-04-05 05:19:07,643 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 05:19:07,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:19:07 BasicIcfg [2022-04-05 05:19:07,657 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 05:19:07,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 05:19:07,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 05:19:07,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 05:19:07,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:19:07" (1/4) ... [2022-04-05 05:19:07,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1141ea30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:19:07, skipping insertion in model container [2022-04-05 05:19:07,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:19:07" (2/4) ... [2022-04-05 05:19:07,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1141ea30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:19:07, skipping insertion in model container [2022-04-05 05:19:07,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:19:07" (3/4) ... [2022-04-05 05:19:07,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1141ea30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:19:07, skipping insertion in model container [2022-04-05 05:19:07,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:19:07" (4/4) ... [2022-04-05 05:19:07,665 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.cqvasr [2022-04-05 05:19:07,668 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 05:19:07,668 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-04-05 05:19:07,703 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 05:19:07,709 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-05 05:19:07,709 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-04-05 05:19:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-05 05:19:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 05:19:07,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:07,728 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:07,728 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1220864783, now seen corresponding path program 1 times [2022-04-05 05:19:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:07,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823973735] [2022-04-05 05:19:07,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:07,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:07,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:07,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823973735] [2022-04-05 05:19:07,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823973735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:07,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:07,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:19:07,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964426198] [2022-04-05 05:19:07,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:07,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:19:07,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:19:07,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:19:07,992 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:08,185 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-05 05:19:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:19:08,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-05 05:19:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:08,194 INFO L225 Difference]: With dead ends: 87 [2022-04-05 05:19:08,194 INFO L226 Difference]: Without dead ends: 69 [2022-04-05 05:19:08,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:08,206 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 126 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:08,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 89 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-05 05:19:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-05 05:19:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-05 05:19:08,229 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2022-04-05 05:19:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:08,230 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-05 05:19:08,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-05 05:19:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 05:19:08,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:08,230 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:08,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 05:19:08,231 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1220896562, now seen corresponding path program 1 times [2022-04-05 05:19:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:08,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464064733] [2022-04-05 05:19:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:08,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:08,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464064733] [2022-04-05 05:19:08,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464064733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:08,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:08,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:19:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276333450] [2022-04-05 05:19:08,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:08,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:19:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:08,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:19:08,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:19:08,278 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:08,426 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-05 05:19:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 05:19:08,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-05 05:19:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:08,428 INFO L225 Difference]: With dead ends: 111 [2022-04-05 05:19:08,428 INFO L226 Difference]: Without dead ends: 109 [2022-04-05 05:19:08,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:19:08,429 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:08,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-05 05:19:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2022-04-05 05:19:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-05 05:19:08,435 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-04-05 05:19:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:08,435 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-05 05:19:08,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-05 05:19:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-05 05:19:08,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:08,436 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:08,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 05:19:08,436 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash -807896157, now seen corresponding path program 1 times [2022-04-05 05:19:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:08,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113949401] [2022-04-05 05:19:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:08,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113949401] [2022-04-05 05:19:08,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113949401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:08,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:08,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:19:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326364001] [2022-04-05 05:19:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:08,505 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:19:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:19:08,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:19:08,505 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:08,598 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-05 05:19:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:19:08,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-05 05:19:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:08,599 INFO L225 Difference]: With dead ends: 73 [2022-04-05 05:19:08,599 INFO L226 Difference]: Without dead ends: 71 [2022-04-05 05:19:08,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:08,600 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:08,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-05 05:19:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-05 05:19:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-05 05:19:08,605 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2022-04-05 05:19:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:08,606 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-05 05:19:08,606 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-05 05:19:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-05 05:19:08,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:08,606 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:08,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 05:19:08,606 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:08,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:08,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1000912364, now seen corresponding path program 1 times [2022-04-05 05:19:08,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:08,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104660937] [2022-04-05 05:19:08,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:08,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:08,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104660937] [2022-04-05 05:19:08,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104660937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:08,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:08,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:19:08,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99592444] [2022-04-05 05:19:08,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:08,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:19:08,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:08,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:19:08,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:19:08,652 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:08,754 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-05 05:19:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:19:08,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-05 05:19:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:08,755 INFO L225 Difference]: With dead ends: 71 [2022-04-05 05:19:08,755 INFO L226 Difference]: Without dead ends: 69 [2022-04-05 05:19:08,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:19:08,756 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:08,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-05 05:19:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-05 05:19:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-05 05:19:08,761 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2022-04-05 05:19:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:08,761 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-05 05:19:08,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-05 05:19:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-05 05:19:08,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:08,768 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:08,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 05:19:08,768 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1947612816, now seen corresponding path program 1 times [2022-04-05 05:19:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:08,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558278737] [2022-04-05 05:19:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:08,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558278737] [2022-04-05 05:19:08,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558278737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:08,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:08,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:19:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009609371] [2022-04-05 05:19:08,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:08,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:19:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:08,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:19:08,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:19:08,812 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:08,920 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-05 05:19:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:19:08,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-05 05:19:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:08,922 INFO L225 Difference]: With dead ends: 69 [2022-04-05 05:19:08,922 INFO L226 Difference]: Without dead ends: 67 [2022-04-05 05:19:08,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:19:08,929 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:08,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 120 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-05 05:19:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-05 05:19:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-05 05:19:08,943 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2022-04-05 05:19:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:08,943 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-05 05:19:08,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-05 05:19:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-05 05:19:08,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:08,944 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:08,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 05:19:08,944 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash 963513474, now seen corresponding path program 1 times [2022-04-05 05:19:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:08,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094521214] [2022-04-05 05:19:08,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:08,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:08,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:08,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094521214] [2022-04-05 05:19:08,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094521214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:08,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:08,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:19:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132404646] [2022-04-05 05:19:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:08,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:19:08,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:19:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:19:08,995 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:09,073 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-05 05:19:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:19:09,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-05 05:19:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:09,074 INFO L225 Difference]: With dead ends: 67 [2022-04-05 05:19:09,074 INFO L226 Difference]: Without dead ends: 63 [2022-04-05 05:19:09,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:09,075 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:09,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-05 05:19:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-05 05:19:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-05 05:19:09,079 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2022-04-05 05:19:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:09,080 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-05 05:19:09,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-05 05:19:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-05 05:19:09,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:09,080 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:09,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-05 05:19:09,081 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash 246456422, now seen corresponding path program 1 times [2022-04-05 05:19:09,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:09,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344835647] [2022-04-05 05:19:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:09,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:09,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344835647] [2022-04-05 05:19:09,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344835647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:09,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:09,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:19:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784375688] [2022-04-05 05:19:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:09,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:19:09,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:09,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:19:09,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:19:09,149 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:09,234 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-05 05:19:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:19:09,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-05 05:19:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:09,235 INFO L225 Difference]: With dead ends: 63 [2022-04-05 05:19:09,235 INFO L226 Difference]: Without dead ends: 59 [2022-04-05 05:19:09,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:09,236 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:09,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 131 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-05 05:19:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-05 05:19:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-05 05:19:09,240 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 16 [2022-04-05 05:19:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:09,240 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-05 05:19:09,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-05 05:19:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-05 05:19:09,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:09,241 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:09,241 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-05 05:19:09,241 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash 246488199, now seen corresponding path program 1 times [2022-04-05 05:19:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:09,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620761493] [2022-04-05 05:19:09,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:09,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620761493] [2022-04-05 05:19:09,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620761493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:09,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:09,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:19:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028784235] [2022-04-05 05:19:09,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:09,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:19:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:09,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:19:09,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:19:09,284 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:09,431 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-04-05 05:19:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:19:09,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-05 05:19:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:09,432 INFO L225 Difference]: With dead ends: 96 [2022-04-05 05:19:09,433 INFO L226 Difference]: Without dead ends: 94 [2022-04-05 05:19:09,433 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:19:09,433 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 88 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:09,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-05 05:19:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2022-04-05 05:19:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-05 05:19:09,437 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2022-04-05 05:19:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:09,438 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-05 05:19:09,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-05 05:19:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 05:19:09,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:09,438 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:09,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-05 05:19:09,439 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:09,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -194897798, now seen corresponding path program 1 times [2022-04-05 05:19:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:09,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202744851] [2022-04-05 05:19:09,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:09,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:09,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202744851] [2022-04-05 05:19:09,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202744851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:09,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:09,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:19:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651259599] [2022-04-05 05:19:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:09,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:19:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:09,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:19:09,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:19:09,510 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:09,612 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-05 05:19:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:19:09,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-05 05:19:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:09,613 INFO L225 Difference]: With dead ends: 74 [2022-04-05 05:19:09,613 INFO L226 Difference]: Without dead ends: 72 [2022-04-05 05:19:09,613 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:19:09,614 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 72 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:09,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-05 05:19:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2022-04-05 05:19:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-05 05:19:09,618 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2022-04-05 05:19:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:09,618 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-05 05:19:09,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-05 05:19:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 05:19:09,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:09,619 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:09,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-05 05:19:09,619 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:09,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash -194865986, now seen corresponding path program 1 times [2022-04-05 05:19:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:09,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228006688] [2022-04-05 05:19:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:09,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228006688] [2022-04-05 05:19:09,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228006688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:09,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:09,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:19:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815647837] [2022-04-05 05:19:09,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:09,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:19:09,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:09,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:19:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:19:09,658 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:09,741 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-05 05:19:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:19:09,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-05 05:19:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:09,741 INFO L225 Difference]: With dead ends: 55 [2022-04-05 05:19:09,742 INFO L226 Difference]: Without dead ends: 53 [2022-04-05 05:19:09,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:19:09,742 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:09,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 90 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-05 05:19:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-05 05:19:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-05 05:19:09,746 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2022-04-05 05:19:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:09,746 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-05 05:19:09,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-05 05:19:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 05:19:09,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:09,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:09,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-05 05:19:09,747 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:09,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -948799137, now seen corresponding path program 1 times [2022-04-05 05:19:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779070387] [2022-04-05 05:19:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:09,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779070387] [2022-04-05 05:19:09,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779070387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:09,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:09,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:19:09,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993096158] [2022-04-05 05:19:09,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:09,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:19:09,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:09,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:19:09,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:09,815 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:09,969 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-05 05:19:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:19:09,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-05 05:19:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:09,970 INFO L225 Difference]: With dead ends: 110 [2022-04-05 05:19:09,970 INFO L226 Difference]: Without dead ends: 108 [2022-04-05 05:19:09,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 05:19:09,971 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 79 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:09,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 233 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-05 05:19:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2022-04-05 05:19:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-05 05:19:09,975 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2022-04-05 05:19:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:09,975 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-05 05:19:09,975 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-05 05:19:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 05:19:09,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:09,975 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:09,976 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-05 05:19:09,976 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1746863154, now seen corresponding path program 1 times [2022-04-05 05:19:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:09,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220577430] [2022-04-05 05:19:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:10,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220577430] [2022-04-05 05:19:10,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220577430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:10,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:10,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:19:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443658208] [2022-04-05 05:19:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:10,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:19:10,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:10,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:19:10,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:10,037 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:10,151 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-04-05 05:19:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:19:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-05 05:19:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:10,153 INFO L225 Difference]: With dead ends: 98 [2022-04-05 05:19:10,153 INFO L226 Difference]: Without dead ends: 96 [2022-04-05 05:19:10,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 05:19:10,154 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 68 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:10,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 146 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-05 05:19:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 62. [2022-04-05 05:19:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-04-05 05:19:10,158 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-04-05 05:19:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:10,158 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-04-05 05:19:10,158 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-05 05:19:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 05:19:10,158 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:10,159 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:10,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-05 05:19:10,159 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1746832336, now seen corresponding path program 1 times [2022-04-05 05:19:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:10,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263701797] [2022-04-05 05:19:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:10,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263701797] [2022-04-05 05:19:10,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263701797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:10,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:10,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:19:10,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993207525] [2022-04-05 05:19:10,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:10,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:19:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:10,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:19:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:19:10,191 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:10,282 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-04-05 05:19:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:19:10,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-05 05:19:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:10,283 INFO L225 Difference]: With dead ends: 82 [2022-04-05 05:19:10,283 INFO L226 Difference]: Without dead ends: 80 [2022-04-05 05:19:10,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:19:10,284 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:10,284 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:10,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-05 05:19:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2022-04-05 05:19:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-05 05:19:10,288 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2022-04-05 05:19:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:10,288 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-05 05:19:10,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-05 05:19:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 05:19:10,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:10,288 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:10,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-05 05:19:10,289 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1745876974, now seen corresponding path program 1 times [2022-04-05 05:19:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:10,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840784678] [2022-04-05 05:19:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840784678] [2022-04-05 05:19:10,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840784678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:10,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:10,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:19:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001988528] [2022-04-05 05:19:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:10,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:19:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:19:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:10,366 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:10,461 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-05 05:19:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 05:19:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-05 05:19:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:10,462 INFO L225 Difference]: With dead ends: 76 [2022-04-05 05:19:10,462 INFO L226 Difference]: Without dead ends: 72 [2022-04-05 05:19:10,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 05:19:10,463 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:10,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 111 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-05 05:19:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-04-05 05:19:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-05 05:19:10,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2022-04-05 05:19:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:10,467 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-05 05:19:10,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-05 05:19:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 05:19:10,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:10,467 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:10,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-05 05:19:10,467 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash 649803267, now seen corresponding path program 1 times [2022-04-05 05:19:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:10,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824391365] [2022-04-05 05:19:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:10,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:10,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824391365] [2022-04-05 05:19:10,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824391365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:10,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:10,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:19:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456258795] [2022-04-05 05:19:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:10,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:19:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:10,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:19:10,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:10,535 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:10,647 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-05 05:19:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 05:19:10,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-05 05:19:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:10,648 INFO L225 Difference]: With dead ends: 72 [2022-04-05 05:19:10,648 INFO L226 Difference]: Without dead ends: 70 [2022-04-05 05:19:10,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-05 05:19:10,648 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 72 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:10,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 96 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-05 05:19:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-04-05 05:19:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-05 05:19:10,652 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-04-05 05:19:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:10,652 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-05 05:19:10,652 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-05 05:19:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-05 05:19:10,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:10,653 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:10,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-05 05:19:10,653 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1682773732, now seen corresponding path program 1 times [2022-04-05 05:19:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:10,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637148035] [2022-04-05 05:19:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:10,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637148035] [2022-04-05 05:19:10,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637148035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:10,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:10,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:19:10,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893399150] [2022-04-05 05:19:10,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:10,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:19:10,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:19:10,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:10,718 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:10,821 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-05 05:19:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:19:10,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-05 05:19:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:10,822 INFO L225 Difference]: With dead ends: 91 [2022-04-05 05:19:10,822 INFO L226 Difference]: Without dead ends: 89 [2022-04-05 05:19:10,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-05 05:19:10,822 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 52 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:10,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 168 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-05 05:19:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-05 05:19:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-05 05:19:10,826 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2022-04-05 05:19:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:10,826 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-05 05:19:10,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-05 05:19:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-05 05:19:10,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:10,827 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:10,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-05 05:19:10,827 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 596762259, now seen corresponding path program 1 times [2022-04-05 05:19:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:10,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146753936] [2022-04-05 05:19:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:10,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:10,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146753936] [2022-04-05 05:19:10,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146753936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:10,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:10,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:19:10,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042816999] [2022-04-05 05:19:10,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:10,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:19:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:10,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:19:10,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:19:10,858 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:10,909 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-05 05:19:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:19:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-05 05:19:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:10,910 INFO L225 Difference]: With dead ends: 67 [2022-04-05 05:19:10,910 INFO L226 Difference]: Without dead ends: 65 [2022-04-05 05:19:10,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:10,911 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:10,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 74 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:19:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-05 05:19:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-05 05:19:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-04-05 05:19:10,914 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2022-04-05 05:19:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:10,915 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-04-05 05:19:10,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-05 05:19:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-05 05:19:10,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:10,915 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:10,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-05 05:19:10,915 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1319762151, now seen corresponding path program 1 times [2022-04-05 05:19:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:10,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041886235] [2022-04-05 05:19:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:10,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:10,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041886235] [2022-04-05 05:19:10,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041886235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:10,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:10,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:19:10,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187917884] [2022-04-05 05:19:10,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:10,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:19:10,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:19:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:19:10,943 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:10,992 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-05 05:19:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:19:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-05 05:19:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:10,993 INFO L225 Difference]: With dead ends: 65 [2022-04-05 05:19:10,993 INFO L226 Difference]: Without dead ends: 61 [2022-04-05 05:19:10,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:10,994 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:10,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:19:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-05 05:19:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-05 05:19:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-05 05:19:10,997 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2022-04-05 05:19:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:10,998 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-05 05:19:10,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-05 05:19:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 05:19:10,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:10,998 INFO L499 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-04-05 05:19:10,998 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-05 05:19:10,998 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2037098268, now seen corresponding path program 1 times [2022-04-05 05:19:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:10,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302566392] [2022-04-05 05:19:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:11,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302566392] [2022-04-05 05:19:11,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302566392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:11,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:11,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:19:11,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233382293] [2022-04-05 05:19:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:11,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:19:11,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:19:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:11,045 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:11,152 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-04-05 05:19:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:19:11,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-05 05:19:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:11,153 INFO L225 Difference]: With dead ends: 76 [2022-04-05 05:19:11,153 INFO L226 Difference]: Without dead ends: 74 [2022-04-05 05:19:11,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-05 05:19:11,154 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:11,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 67 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-05 05:19:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-04-05 05:19:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-04-05 05:19:11,157 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2022-04-05 05:19:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:11,157 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-04-05 05:19:11,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-04-05 05:19:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 05:19:11,158 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:11,158 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:11,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-05 05:19:11,158 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash 319828265, now seen corresponding path program 1 times [2022-04-05 05:19:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:11,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619947] [2022-04-05 05:19:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:11,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:11,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:11,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:11,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619947] [2022-04-05 05:19:11,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:19:11,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544582870] [2022-04-05 05:19:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:19:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:19:11,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:19:11,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 05:19:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:11,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-05 05:19:11,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:19:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:11,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:19:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 05:19:11,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544582870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:19:11,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:19:11,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-05 05:19:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955207539] [2022-04-05 05:19:11,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:19:11,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 05:19:11,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:11,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 05:19:11,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-05 05:19:11,604 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:11,847 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-04-05 05:19:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-05 05:19:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-05 05:19:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:11,848 INFO L225 Difference]: With dead ends: 102 [2022-04-05 05:19:11,848 INFO L226 Difference]: Without dead ends: 100 [2022-04-05 05:19:11,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-04-05 05:19:11,848 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 177 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:11,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 138 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-05 05:19:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-04-05 05:19:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-05 05:19:11,852 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-04-05 05:19:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:11,852 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-05 05:19:11,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-05 05:19:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-05 05:19:11,853 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:11,853 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:11,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-05 05:19:12,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:19:12,053 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1322547065, now seen corresponding path program 1 times [2022-04-05 05:19:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:12,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014753679] [2022-04-05 05:19:12,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:12,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:12,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:12,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014753679] [2022-04-05 05:19:12,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014753679] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:19:12,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045639113] [2022-04-05 05:19:12,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:12,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:19:12,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:19:12,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 05:19:12,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 05:19:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:12,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-05 05:19:12,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:19:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:12,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:19:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 05:19:12,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045639113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:19:12,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:19:12,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-05 05:19:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507723041] [2022-04-05 05:19:12,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:19:12,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 05:19:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:12,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 05:19:12,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-05 05:19:12,372 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:12,595 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-05 05:19:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-05 05:19:12,596 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-05 05:19:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:12,596 INFO L225 Difference]: With dead ends: 82 [2022-04-05 05:19:12,596 INFO L226 Difference]: Without dead ends: 80 [2022-04-05 05:19:12,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2022-04-05 05:19:12,597 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 231 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:12,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 97 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-05 05:19:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 44. [2022-04-05 05:19:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-05 05:19:12,601 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2022-04-05 05:19:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:12,601 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-05 05:19:12,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-05 05:19:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-05 05:19:12,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:12,601 INFO L499 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] [2022-04-05 05:19:12,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-05 05:19:12,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-05 05:19:12,808 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1198767470, now seen corresponding path program 1 times [2022-04-05 05:19:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:12,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710442291] [2022-04-05 05:19:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:12,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710442291] [2022-04-05 05:19:12,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710442291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:12,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:12,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:19:12,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276007282] [2022-04-05 05:19:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:12,851 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:19:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:19:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:12,852 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:12,969 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-05 05:19:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:19:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-05 05:19:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:12,970 INFO L225 Difference]: With dead ends: 56 [2022-04-05 05:19:12,970 INFO L226 Difference]: Without dead ends: 54 [2022-04-05 05:19:12,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-05 05:19:12,971 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:12,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 53 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-05 05:19:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-04-05 05:19:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-04-05 05:19:12,976 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-04-05 05:19:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:12,976 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-04-05 05:19:12,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-05 05:19:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-05 05:19:12,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:12,977 INFO L499 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] [2022-04-05 05:19:12,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-05 05:19:12,978 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-05 05:19:12,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1199753650, now seen corresponding path program 1 times [2022-04-05 05:19:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:12,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073086889] [2022-04-05 05:19:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:19:13,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:13,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073086889] [2022-04-05 05:19:13,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073086889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:13,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:13,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:19:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696614500] [2022-04-05 05:19:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:13,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:19:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:13,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:19:13,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:19:13,034 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:13,111 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-05 05:19:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 05:19:13,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-05 05:19:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:13,112 INFO L225 Difference]: With dead ends: 39 [2022-04-05 05:19:13,112 INFO L226 Difference]: Without dead ends: 0 [2022-04-05 05:19:13,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-05 05:19:13,113 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 46 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:13,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 43 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:19:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-05 05:19:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-05 05:19:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-05 05:19:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-05 05:19:13,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-05 05:19:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:13,115 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-05 05:19:13,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-05 05:19:13,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-05 05:19:13,119 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-04-05 05:19:13,119 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-04-05 05:19:13,119 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-04-05 05:19:13,119 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-04-05 05:19:13,119 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-04-05 05:19:13,119 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-04-05 05:19:13,120 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-04-05 05:19:13,121 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-04-05 05:19:13,121 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-04-05 05:19:13,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-05 05:19:13,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-05 05:21:41,535 WARN L232 SmtUtils]: Spent 2.46m on a formula simplification. DAG size of input: 78 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-05 05:22:13,371 WARN L232 SmtUtils]: Spent 31.75s on a formula simplification. DAG size of input: 91 DAG size of output: 92 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-05 05:22:13,911 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-05 05:22:13,911 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-05 05:22:13,911 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-05 05:22:13,911 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-05 05:22:13,911 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-05 05:22:13,911 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-05 05:22:13,911 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 15 375) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 15 375) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 15 375) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L878 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (or (and (let ((.cse2 (<= main_~main__t~0 1))) (let ((.cse0 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse2 .cse3) (and .cse3 (not (= main_~__VERIFIER_assert__cond~17 0)))))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= 1 main_~__VERIFIER_assert__cond~17) .cse0 .cse1) (and .cse2 .cse0 .cse1)))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) (and (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))) [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L878 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 main_~main__t~0))) (or (and .cse2 .cse3 .cse1) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and (<= 1 main_~__VERIFIER_assert__cond~17) .cse0) (and .cse1 .cse0))))) [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2022-04-05 05:22:13,912 INFO L882 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L878 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (<= 1 main_~__VERIFIER_assert__cond~1) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L882 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-05 05:22:13,913 INFO L878 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L878 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (<= 1 main_~__VERIFIER_assert__cond~1) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2022-04-05 05:22:13,914 INFO L882 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-04-05 05:22:13,915 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2022-04-05 05:22:13,917 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:22:13,918 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 05:22:13,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:22:13 BasicIcfg [2022-04-05 05:22:13,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 05:22:13,941 INFO L158 Benchmark]: Toolchain (without parser) took 186936.17ms. Allocated memory was 187.7MB in the beginning and 469.8MB in the end (delta: 282.1MB). Free memory was 135.8MB in the beginning and 200.1MB in the end (delta: -64.3MB). Peak memory consumption was 254.6MB. Max. memory is 8.0GB. [2022-04-05 05:22:13,941 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 05:22:13,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.54ms. Allocated memory is still 187.7MB. Free memory was 135.6MB in the beginning and 158.9MB in the end (delta: -23.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-05 05:22:13,941 INFO L158 Benchmark]: Boogie Preprocessor took 34.98ms. Allocated memory is still 187.7MB. Free memory was 158.9MB in the beginning and 157.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-05 05:22:13,941 INFO L158 Benchmark]: RCFGBuilder took 300.80ms. Allocated memory is still 187.7MB. Free memory was 157.2MB in the beginning and 143.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-05 05:22:13,941 INFO L158 Benchmark]: IcfgTransformer took 17.82ms. Allocated memory is still 187.7MB. Free memory was 143.0MB in the beginning and 141.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-05 05:22:13,942 INFO L158 Benchmark]: TraceAbstraction took 186282.15ms. Allocated memory was 187.7MB in the beginning and 469.8MB in the end (delta: 282.1MB). Free memory was 140.7MB in the beginning and 200.1MB in the end (delta: -59.5MB). Peak memory consumption was 259.5MB. Max. memory is 8.0GB. [2022-04-05 05:22:13,942 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 187.7MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 294.54ms. Allocated memory is still 187.7MB. Free memory was 135.6MB in the beginning and 158.9MB in the end (delta: -23.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.98ms. Allocated memory is still 187.7MB. Free memory was 158.9MB in the beginning and 157.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 300.80ms. Allocated memory is still 187.7MB. Free memory was 157.2MB in the beginning and 143.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 17.82ms. Allocated memory is still 187.7MB. Free memory was 143.0MB in the beginning and 141.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 186282.15ms. Allocated memory was 187.7MB in the beginning and 469.8MB in the end (delta: 282.1MB). Free memory was 140.7MB in the beginning and 200.1MB in the end (delta: -59.5MB). Peak memory consumption was 259.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 186.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 180.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1636 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1636 mSDsluCounter, 2733 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1700 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3268 IncrementalHoareTripleChecker+Invalid, 3478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 1033 mSDtfsCounter, 3268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 194, 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, 23 MinimizatonAttempts, 365 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 189 HoareAnnotationTreeSize, 9 FomulaSimplifications, 222439 FormulaSimplificationTreeSizeReduction, 180.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3450178 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 2171 SizeOfPredicates, 6 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((1 <= __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && ((1 <= __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) || (main__t == 0 && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0))))) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((1 <= __VERIFIER_assert__cond && ((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__t) || ((main__t <= 1 && ((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__t)) && !(main__tagbuf_len <= main__t)) || (main__t < main__tagbuf_len && main__t == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((1 <= __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t)) && 1 <= main__t RESULT: Ultimate proved your program to be correct! [2022-04-05 05:22:13,968 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...