/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-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 09:40:00,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 09:40:00,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 09:40:00,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 09:40:00,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 09:40:00,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 09:40:00,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 09:40:00,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 09:40:00,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 09:40:00,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 09:40:00,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 09:40:00,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 09:40:00,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 09:40:00,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 09:40:00,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 09:40:00,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 09:40:00,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 09:40:00,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 09:40:00,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 09:40:00,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 09:40:00,637 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 09:40:00,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 09:40:00,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 09:40:00,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 09:40:00,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 09:40:00,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 09:40:00,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 09:40:00,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 09:40:00,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 09:40:00,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 09:40:00,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 09:40:00,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 09:40:00,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 09:40:00,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 09:40:00,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 09:40:00,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 09:40:00,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 09:40:00,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 09:40:00,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 09:40:00,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 09:40:00,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 09:40:00,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 09:40:00,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 09:40:00,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 09:40:00,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 09:40:00,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 09:40:00,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 09:40:00,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 09:40:00,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 09:40:00,676 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 09:40:00,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 09:40:00,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 09:40:00,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 09:40:00,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 09:40:00,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 09:40:00,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 09:40:00,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 09:40:00,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 09:40:00,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 09:40:00,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 09:40:00,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 09:40:00,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 09:40:00,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:40:00,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 09:40:00,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 09:40:00,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 09:40:00,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 09:40:00,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 09:40:00,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 09:40:00,679 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 09:40:00,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 09:40:00,680 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 09:40:00,680 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-06 09:40:00,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 09:40:00,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 09:40:00,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 09:40:00,867 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 09:40:00,867 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 09:40:00,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-06 09:40:00,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48b0e46/315d9737bed64d85b8fc0d3dc264f613/FLAGef81cebac [2022-04-06 09:40:01,290 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 09:40:01,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-06 09:40:01,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48b0e46/315d9737bed64d85b8fc0d3dc264f613/FLAGef81cebac [2022-04-06 09:40:01,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48b0e46/315d9737bed64d85b8fc0d3dc264f613 [2022-04-06 09:40:01,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 09:40:01,315 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 09:40:01,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 09:40:01,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 09:40:01,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 09:40:01,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16131e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01, skipping insertion in model container [2022-04-06 09:40:01,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 09:40:01,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 09:40:01,533 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-04-06 09:40:01,540 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-04-06 09:40:01,541 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-04-06 09:40:01,544 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-04-06 09:40:01,546 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-04-06 09:40:01,548 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-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-04-06 09:40:01,550 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-04-06 09:40:01,552 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-04-06 09:40:01,558 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-04-06 09:40:01,559 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-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-04-06 09:40:01,561 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-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-04-06 09:40:01,564 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-04-06 09:40:01,567 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-04-06 09:40:01,569 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-04-06 09:40:01,571 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-04-06 09:40:01,577 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-04-06 09:40:01,583 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-04-06 09:40:01,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-04-06 09:40:01,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:40:01,596 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 09:40:01,611 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-04-06 09:40:01,616 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-04-06 09:40:01,617 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-04-06 09:40:01,618 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-04-06 09:40:01,619 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-04-06 09:40:01,620 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-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-04-06 09:40:01,621 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-04-06 09:40:01,622 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-04-06 09:40:01,623 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-04-06 09:40:01,624 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-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-04-06 09:40:01,625 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-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-04-06 09:40:01,626 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-04-06 09:40:01,627 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-04-06 09:40:01,628 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-04-06 09:40:01,629 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-04-06 09:40:01,629 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-04-06 09:40:01,631 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-04-06 09:40:01,631 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-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-04-06 09:40:01,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:40:01,641 INFO L208 MainTranslator]: Completed translation [2022-04-06 09:40:01,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01 WrapperNode [2022-04-06 09:40:01,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 09:40:01,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 09:40:01,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 09:40:01,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 09:40:01,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 09:40:01,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 09:40:01,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 09:40:01,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 09:40:01,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (1/1) ... [2022-04-06 09:40:01,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:40:01,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:40:01,711 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-06 09:40:01,713 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-06 09:40:01,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 09:40:01,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 09:40:01,742 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 09:40:01,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 09:40:01,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 09:40:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 09:40:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 09:40:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 09:40:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 09:40:01,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 09:40:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 09:40:01,801 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 09:40:01,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 09:40:02,006 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 09:40:02,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 09:40:02,011 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-06 09:40:02,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:40:02 BoogieIcfgContainer [2022-04-06 09:40:02,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 09:40:02,013 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 09:40:02,013 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 09:40:02,018 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 09:40:02,020 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:40:02" (1/1) ... [2022-04-06 09:40:02,022 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 09:40:02,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:40:02 BasicIcfg [2022-04-06 09:40:02,039 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 09:40:02,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 09:40:02,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 09:40:02,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 09:40:02,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:40:01" (1/4) ... [2022-04-06 09:40:02,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fce9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:40:02, skipping insertion in model container [2022-04-06 09:40:02,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:01" (2/4) ... [2022-04-06 09:40:02,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fce9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:40:02, skipping insertion in model container [2022-04-06 09:40:02,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:40:02" (3/4) ... [2022-04-06 09:40:02,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fce9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:40:02, skipping insertion in model container [2022-04-06 09:40:02,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:40:02" (4/4) ... [2022-04-06 09:40:02,044 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.cqvasr [2022-04-06 09:40:02,047 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 09:40:02,048 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-06 09:40:02,076 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 09:40:02,080 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-06 09:40:02,080 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-06 09:40:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 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-06 09:40:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-06 09:40:02,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:02,095 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-06 09:40:02,095 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash 317693851, now seen corresponding path program 1 times [2022-04-06 09:40:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:02,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662389208] [2022-04-06 09:40:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:02,293 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-06 09:40:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:02,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662389208] [2022-04-06 09:40:02,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662389208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:02,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 09:40:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562980823] [2022-04-06 09:40:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:02,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 09:40:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:02,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 09:40:02,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 09:40:02,321 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 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 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-06 09:40:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:02,419 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-06 09:40:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 09:40:02,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-06 09:40:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:02,427 INFO L225 Difference]: With dead ends: 93 [2022-04-06 09:40:02,428 INFO L226 Difference]: Without dead ends: 80 [2022-04-06 09:40:02,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:02,432 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:02,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-06 09:40:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-06 09:40:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 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-06 09:40:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-06 09:40:02,456 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-06 09:40:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:02,457 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-06 09:40:02,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-06 09:40:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-06 09:40:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 09:40:02,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:02,458 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-06 09:40:02,458 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 09:40:02,458 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1258576075, now seen corresponding path program 1 times [2022-04-06 09:40:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:02,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951365953] [2022-04-06 09:40:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:02,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:02,517 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-06 09:40:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:02,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951365953] [2022-04-06 09:40:02,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951365953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:02,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:02,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:40:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454840839] [2022-04-06 09:40:02,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:02,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:02,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:02,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:02,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:02,520 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-06 09:40:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:02,612 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-06 09:40:02,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:02,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-06 09:40:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:02,615 INFO L225 Difference]: With dead ends: 80 [2022-04-06 09:40:02,615 INFO L226 Difference]: Without dead ends: 78 [2022-04-06 09:40:02,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:02,618 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 319 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:02,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 74 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-06 09:40:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-06 09:40:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 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-06 09:40:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-06 09:40:02,640 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-06 09:40:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:02,641 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-06 09:40:02,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-06 09:40:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-06 09:40:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 09:40:02,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:02,642 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-06 09:40:02,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 09:40:02,642 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1689129137, now seen corresponding path program 1 times [2022-04-06 09:40:02,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:02,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729261698] [2022-04-06 09:40:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:02,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:02,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:02,725 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-06 09:40:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:02,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729261698] [2022-04-06 09:40:02,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729261698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:02,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:02,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:40:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583165804] [2022-04-06 09:40:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:02,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:40:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:40:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:02,728 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-06 09:40:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:02,845 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-06 09:40:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:02,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-06 09:40:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:02,846 INFO L225 Difference]: With dead ends: 101 [2022-04-06 09:40:02,847 INFO L226 Difference]: Without dead ends: 99 [2022-04-06 09:40:02,847 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-06 09:40:02,848 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 207 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:02,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-06 09:40:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-06 09:40:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 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-06 09:40:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-06 09:40:02,853 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-06 09:40:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:02,853 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-06 09:40:02,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-06 09:40:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-06 09:40:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 09:40:02,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:02,854 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-06 09:40:02,854 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 09:40:02,854 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash -823394398, now seen corresponding path program 1 times [2022-04-06 09:40:02,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:02,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890498404] [2022-04-06 09:40:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:02,908 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-06 09:40:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:02,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890498404] [2022-04-06 09:40:02,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890498404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:02,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:02,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:02,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886802505] [2022-04-06 09:40:02,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:02,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:02,910 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-06 09:40:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:02,988 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-06 09:40:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:02,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-06 09:40:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:02,989 INFO L225 Difference]: With dead ends: 76 [2022-04-06 09:40:02,989 INFO L226 Difference]: Without dead ends: 74 [2022-04-06 09:40:02,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 09:40:02,990 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:02,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 70 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-06 09:40:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-06 09:40:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 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-06 09:40:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-06 09:40:02,995 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-06 09:40:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:02,995 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-06 09:40:02,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-06 09:40:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-06 09:40:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-06 09:40:02,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:02,996 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, 1, 1, 1] [2022-04-06 09:40:02,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 09:40:02,996 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1183023144, now seen corresponding path program 1 times [2022-04-06 09:40:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879802757] [2022-04-06 09:40:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,071 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-06 09:40:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:03,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879802757] [2022-04-06 09:40:03,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879802757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:03,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:03,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853450961] [2022-04-06 09:40:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:03,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:03,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:03,073 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-06 09:40:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:03,319 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-06 09:40:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:40:03,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 26 [2022-04-06 09:40:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:03,321 INFO L225 Difference]: With dead ends: 141 [2022-04-06 09:40:03,321 INFO L226 Difference]: Without dead ends: 139 [2022-04-06 09:40:03,321 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:03,322 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:03,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 125 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 09:40:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-06 09:40:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-06 09:40:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 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-06 09:40:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-06 09:40:03,342 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-06 09:40:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:03,343 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-06 09:40:03,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-06 09:40:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-06 09:40:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-06 09:40:03,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:03,344 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, 1, 1, 1] [2022-04-06 09:40:03,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 09:40:03,344 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1182992326, now seen corresponding path program 1 times [2022-04-06 09:40:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:03,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466362543] [2022-04-06 09:40:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,418 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-06 09:40:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:03,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466362543] [2022-04-06 09:40:03,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466362543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:03,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:03,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16856930] [2022-04-06 09:40:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:03,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:03,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:03,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:03,425 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-06 09:40:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:03,593 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-04-06 09:40:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:40:03,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 26 [2022-04-06 09:40:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:03,595 INFO L225 Difference]: With dead ends: 108 [2022-04-06 09:40:03,595 INFO L226 Difference]: Without dead ends: 106 [2022-04-06 09:40:03,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:03,597 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 220 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:03,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 81 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-06 09:40:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-06 09:40:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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-06 09:40:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-06 09:40:03,606 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-06 09:40:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:03,607 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-06 09:40:03,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-06 09:40:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-06 09:40:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-06 09:40:03,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:03,608 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, 1, 1, 1, 1] [2022-04-06 09:40:03,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 09:40:03,608 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:03,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1980989516, now seen corresponding path program 1 times [2022-04-06 09:40:03,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:03,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734935025] [2022-04-06 09:40:03,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:40:03,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:03,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734935025] [2022-04-06 09:40:03,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734935025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:03,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:03,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:03,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098660161] [2022-04-06 09:40:03,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:03,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:03,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:03,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:03,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:03,660 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 09:40:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:03,788 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-04-06 09:40:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:03,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2022-04-06 09:40:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:03,789 INFO L225 Difference]: With dead ends: 121 [2022-04-06 09:40:03,789 INFO L226 Difference]: Without dead ends: 119 [2022-04-06 09:40:03,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 09:40:03,790 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 215 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:03,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 104 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-06 09:40:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-06 09:40:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 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-06 09:40:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-06 09:40:03,794 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-06 09:40:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:03,794 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-06 09:40:03,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 09:40:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-06 09:40:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-06 09:40:03,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:03,795 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, 1, 1, 1, 1] [2022-04-06 09:40:03,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 09:40:03,795 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:03,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1981944876, now seen corresponding path program 1 times [2022-04-06 09:40:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:03,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578964826] [2022-04-06 09:40:03,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,852 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-06 09:40:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:03,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578964826] [2022-04-06 09:40:03,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578964826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:03,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:03,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79611231] [2022-04-06 09:40:03,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:03,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:03,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:03,854 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 09:40:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:03,937 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-06 09:40:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:03,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2022-04-06 09:40:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:03,938 INFO L225 Difference]: With dead ends: 77 [2022-04-06 09:40:03,938 INFO L226 Difference]: Without dead ends: 75 [2022-04-06 09:40:03,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 09:40:03,939 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 197 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:03,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-06 09:40:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-06 09:40:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 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-06 09:40:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-06 09:40:03,943 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-06 09:40:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:03,943 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-06 09:40:03,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-06 09:40:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-06 09:40:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 09:40:03,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:03,944 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, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:03,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 09:40:03,944 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1978555952, now seen corresponding path program 1 times [2022-04-06 09:40:03,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:03,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081079677] [2022-04-06 09:40:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:03,968 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-06 09:40:03,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:03,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081079677] [2022-04-06 09:40:03,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081079677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:03,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:03,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 09:40:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517675644] [2022-04-06 09:40:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:03,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 09:40:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:03,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 09:40:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 09:40:03,969 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-06 09:40:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:04,028 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-04-06 09:40:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 09:40:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2022-04-06 09:40:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:04,029 INFO L225 Difference]: With dead ends: 115 [2022-04-06 09:40:04,029 INFO L226 Difference]: Without dead ends: 75 [2022-04-06 09:40:04,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:04,029 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:04,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-06 09:40:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-06 09:40:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 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-06 09:40:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-06 09:40:04,033 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-06 09:40:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:04,033 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-06 09:40:04,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-06 09:40:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-06 09:40:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-06 09:40:04,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:04,034 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:04,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 09:40:04,034 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:04,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1860757727, now seen corresponding path program 1 times [2022-04-06 09:40:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:04,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065255972] [2022-04-06 09:40:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,070 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-06 09:40:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065255972] [2022-04-06 09:40:04,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065255972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:04,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:04,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559526236] [2022-04-06 09:40:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:04,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:04,071 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-06 09:40:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:04,160 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-06 09:40:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2022-04-06 09:40:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:04,161 INFO L225 Difference]: With dead ends: 76 [2022-04-06 09:40:04,161 INFO L226 Difference]: Without dead ends: 74 [2022-04-06 09:40:04,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-06 09:40:04,162 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:04,163 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-06 09:40:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-06 09:40:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 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-06 09:40:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-06 09:40:04,166 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-06 09:40:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:04,167 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-06 09:40:04,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-06 09:40:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-06 09:40:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-06 09:40:04,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:04,169 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:04,169 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 09:40:04,170 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1486248991, now seen corresponding path program 1 times [2022-04-06 09:40:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:04,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701032198] [2022-04-06 09:40:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 09:40:04,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:04,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701032198] [2022-04-06 09:40:04,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701032198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:40:04,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958347628] [2022-04-06 09:40:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:04,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:40:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:40:04,228 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-06 09:40:04,235 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-06 09:40:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 09:40:04,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:40:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 09:40:04,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:40:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 09:40:04,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958347628] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:40:04,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:40:04,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-06 09:40:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853172073] [2022-04-06 09:40:04,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:40:04,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:04,452 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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-06 09:40:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:04,571 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-06 09:40:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:04,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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 30 [2022-04-06 09:40:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:04,572 INFO L225 Difference]: With dead ends: 111 [2022-04-06 09:40:04,572 INFO L226 Difference]: Without dead ends: 109 [2022-04-06 09:40:04,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:04,573 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:04,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 97 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-06 09:40:04,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-06 09:40:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 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-06 09:40:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-06 09:40:04,576 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-06 09:40:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:04,576 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-06 09:40:04,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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-06 09:40:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-06 09:40:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-06 09:40:04,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:04,577 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:04,594 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-06 09:40:04,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-06 09:40:04,794 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:04,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1848916017, now seen corresponding path program 1 times [2022-04-06 09:40:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:04,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468515753] [2022-04-06 09:40:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,824 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-06 09:40:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:04,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468515753] [2022-04-06 09:40:04,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468515753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:04,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:04,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576659126] [2022-04-06 09:40:04,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:04,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:04,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:04,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:04,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:04,826 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-06 09:40:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:04,895 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-06 09:40:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:04,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2022-04-06 09:40:04,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:04,896 INFO L225 Difference]: With dead ends: 70 [2022-04-06 09:40:04,896 INFO L226 Difference]: Without dead ends: 68 [2022-04-06 09:40:04,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 09:40:04,896 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:04,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:04,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-06 09:40:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-06 09:40:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 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-06 09:40:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-06 09:40:04,900 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-06 09:40:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:04,900 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-06 09:40:04,900 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-06 09:40:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-06 09:40:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-06 09:40:04,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:04,900 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:04,901 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 09:40:04,901 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:04,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:04,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1170891010, now seen corresponding path program 1 times [2022-04-06 09:40:04,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:04,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863711305] [2022-04-06 09:40:04,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 09:40:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:04,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863711305] [2022-04-06 09:40:04,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863711305] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:40:04,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810189060] [2022-04-06 09:40:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:04,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:40:04,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:40:04,951 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-06 09:40:04,982 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-06 09:40:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:04,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 09:40:04,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:40:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 09:40:05,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:40:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 09:40:05,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810189060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:40:05,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:40:05,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-06 09:40:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347779846] [2022-04-06 09:40:05,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:40:05,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:05,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:05,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:05,108 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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-06 09:40:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:05,187 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-06 09:40:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:05,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2022-04-06 09:40:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:05,188 INFO L225 Difference]: With dead ends: 69 [2022-04-06 09:40:05,188 INFO L226 Difference]: Without dead ends: 67 [2022-04-06 09:40:05,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:05,189 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 166 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:05,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 61 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-06 09:40:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-06 09:40:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 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-06 09:40:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-06 09:40:05,192 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-06 09:40:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:05,192 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-06 09:40:05,192 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 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-06 09:40:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-06 09:40:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-06 09:40:05,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:05,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:05,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-06 09:40:05,407 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,SelfDestructingSolverStorable12 [2022-04-06 09:40:05,408 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1897188956, now seen corresponding path program 1 times [2022-04-06 09:40:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:05,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189346351] [2022-04-06 09:40:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:05,446 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-06 09:40:05,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:05,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189346351] [2022-04-06 09:40:05,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189346351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:05,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:05,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:05,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543431515] [2022-04-06 09:40:05,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:05,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:05,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:05,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:05,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:05,448 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-06 09:40:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:05,514 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-06 09:40:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:05,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2022-04-06 09:40:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:05,515 INFO L225 Difference]: With dead ends: 63 [2022-04-06 09:40:05,515 INFO L226 Difference]: Without dead ends: 61 [2022-04-06 09:40:05,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-06 09:40:05,515 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:05,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-06 09:40:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-06 09:40:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 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-06 09:40:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-06 09:40:05,518 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-06 09:40:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:05,518 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-06 09:40:05,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-06 09:40:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-06 09:40:05,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-06 09:40:05,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:05,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:05,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-06 09:40:05,519 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1316685848, now seen corresponding path program 1 times [2022-04-06 09:40:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:05,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819707222] [2022-04-06 09:40:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:05,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:05,553 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-06 09:40:05,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:05,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819707222] [2022-04-06 09:40:05,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819707222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:05,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:05,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:40:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234240904] [2022-04-06 09:40:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:05,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:05,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:05,554 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-06 09:40:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:05,644 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-06 09:40:05,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:05,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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 35 [2022-04-06 09:40:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:05,645 INFO L225 Difference]: With dead ends: 71 [2022-04-06 09:40:05,645 INFO L226 Difference]: Without dead ends: 69 [2022-04-06 09:40:05,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:05,647 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 153 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:05,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 62 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-06 09:40:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-06 09:40:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 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-06 09:40:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-06 09:40:05,651 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-06 09:40:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:05,651 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-06 09:40:05,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-06 09:40:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-06 09:40:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-06 09:40:05,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:05,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:05,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-06 09:40:05,651 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash -546914678, now seen corresponding path program 1 times [2022-04-06 09:40:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:05,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002105794] [2022-04-06 09:40:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:05,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:05,695 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-06 09:40:05,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:05,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002105794] [2022-04-06 09:40:05,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002105794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:05,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:05,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859586742] [2022-04-06 09:40:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:05,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:05,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:05,696 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-06 09:40:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:05,839 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-06 09:40:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:40:05,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 38 [2022-04-06 09:40:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:05,840 INFO L225 Difference]: With dead ends: 91 [2022-04-06 09:40:05,840 INFO L226 Difference]: Without dead ends: 89 [2022-04-06 09:40:05,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:05,841 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 178 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:05,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 60 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-06 09:40:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-06 09:40:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 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-06 09:40:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-06 09:40:05,845 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-06 09:40:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:05,845 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-06 09:40:05,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-06 09:40:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-06 09:40:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-06 09:40:05,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:05,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:05,846 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-06 09:40:05,846 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:05,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash 225515518, now seen corresponding path program 1 times [2022-04-06 09:40:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:05,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774683652] [2022-04-06 09:40:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:05,916 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-06 09:40:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:05,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774683652] [2022-04-06 09:40:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774683652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:05,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:05,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331846878] [2022-04-06 09:40:05,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:05,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:05,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:05,918 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-06 09:40:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:06,033 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-06 09:40:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:06,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 39 [2022-04-06 09:40:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:06,034 INFO L225 Difference]: With dead ends: 61 [2022-04-06 09:40:06,034 INFO L226 Difference]: Without dead ends: 59 [2022-04-06 09:40:06,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 09:40:06,035 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:06,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-06 09:40:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-06 09:40:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 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-06 09:40:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-06 09:40:06,038 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-06 09:40:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:06,038 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-06 09:40:06,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-06 09:40:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-06 09:40:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-06 09:40:06,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:06,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:06,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-06 09:40:06,039 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1972090370, now seen corresponding path program 1 times [2022-04-06 09:40:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:06,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839256825] [2022-04-06 09:40:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,065 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-06 09:40:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:06,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839256825] [2022-04-06 09:40:06,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839256825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:06,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:06,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:40:06,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208040902] [2022-04-06 09:40:06,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:06,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:40:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:06,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:40:06,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:06,066 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-06 09:40:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:06,158 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-06 09:40:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:06,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 41 [2022-04-06 09:40:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:06,158 INFO L225 Difference]: With dead ends: 70 [2022-04-06 09:40:06,158 INFO L226 Difference]: Without dead ends: 68 [2022-04-06 09:40:06,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:06,159 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:06,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-06 09:40:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-06 09:40:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 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-06 09:40:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-06 09:40:06,162 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-06 09:40:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:06,162 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-06 09:40:06,162 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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-06 09:40:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-06 09:40:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-06 09:40:06,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:06,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:06,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-06 09:40:06,163 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:06,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1005260689, now seen corresponding path program 1 times [2022-04-06 09:40:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:06,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497442817] [2022-04-06 09:40:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,190 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-06 09:40:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:06,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497442817] [2022-04-06 09:40:06,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497442817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:06,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:06,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176664360] [2022-04-06 09:40:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:06,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:06,191 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-06 09:40:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:06,276 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-06 09:40:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:06,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 42 [2022-04-06 09:40:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:06,277 INFO L225 Difference]: With dead ends: 66 [2022-04-06 09:40:06,277 INFO L226 Difference]: Without dead ends: 64 [2022-04-06 09:40:06,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-06 09:40:06,277 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:06,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-06 09:40:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-06 09:40:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 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-06 09:40:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-06 09:40:06,281 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-06 09:40:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:06,281 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-06 09:40:06,281 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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-06 09:40:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-06 09:40:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-06 09:40:06,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:06,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:06,282 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-06 09:40:06,282 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:06,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1098311654, now seen corresponding path program 1 times [2022-04-06 09:40:06,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:06,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913137723] [2022-04-06 09:40:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:06,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,325 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-06 09:40:06,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:06,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913137723] [2022-04-06 09:40:06,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913137723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:06,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:06,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:06,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615696688] [2022-04-06 09:40:06,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:06,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:06,327 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-06 09:40:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:06,477 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-06 09:40:06,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:40:06,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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 43 [2022-04-06 09:40:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:06,478 INFO L225 Difference]: With dead ends: 88 [2022-04-06 09:40:06,478 INFO L226 Difference]: Without dead ends: 86 [2022-04-06 09:40:06,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:06,479 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:06,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-06 09:40:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-06 09:40:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 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-06 09:40:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-06 09:40:06,487 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-06 09:40:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:06,487 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-06 09:40:06,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-06 09:40:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-06 09:40:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 09:40:06,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:06,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:06,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-06 09:40:06,488 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash -312075723, now seen corresponding path program 1 times [2022-04-06 09:40:06,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:06,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947666153] [2022-04-06 09:40:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,527 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-06 09:40:06,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:06,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947666153] [2022-04-06 09:40:06,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947666153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:06,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:06,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367035584] [2022-04-06 09:40:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:06,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:06,530 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06 09:40:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:06,632 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-06 09:40:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 44 [2022-04-06 09:40:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:06,633 INFO L225 Difference]: With dead ends: 73 [2022-04-06 09:40:06,633 INFO L226 Difference]: Without dead ends: 71 [2022-04-06 09:40:06,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 09:40:06,634 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:06,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 69 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-06 09:40:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-04-06 09:40:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 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-06 09:40:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-06 09:40:06,638 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-06 09:40:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:06,638 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-06 09:40:06,638 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-06 09:40:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-06 09:40:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 09:40:06,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:06,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:06,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-06 09:40:06,639 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:06,639 INFO L85 PathProgramCache]: Analyzing trace with hash -283140749, now seen corresponding path program 1 times [2022-04-06 09:40:06,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:06,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118828988] [2022-04-06 09:40:06,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:06,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,697 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-06 09:40:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:06,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118828988] [2022-04-06 09:40:06,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118828988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:40:06,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619457785] [2022-04-06 09:40:06,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:06,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:40:06,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:40:06,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:40:06,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-06 09:40:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:06,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 09:40:06,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:40:06,828 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-06 09:40:06,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:40:06,902 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-06 09:40:06,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619457785] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:40:06,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:40:06,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-06 09:40:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362842197] [2022-04-06 09:40:06,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:40:06,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:06,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:06,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:06,904 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-06 09:40:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:06,971 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-06 09:40:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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 44 [2022-04-06 09:40:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:06,973 INFO L225 Difference]: With dead ends: 58 [2022-04-06 09:40:06,973 INFO L226 Difference]: Without dead ends: 56 [2022-04-06 09:40:06,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:06,974 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 98 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:06,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 42 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-06 09:40:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-06 09:40:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 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-06 09:40:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-06 09:40:06,977 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-06 09:40:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:06,977 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-06 09:40:06,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-06 09:40:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-06 09:40:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-06 09:40:06,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:06,978 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:06,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-06 09:40:07,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:40:07,188 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:07,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1506676067, now seen corresponding path program 1 times [2022-04-06 09:40:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791724087] [2022-04-06 09:40:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-06 09:40:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:07,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791724087] [2022-04-06 09:40:07,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791724087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:07,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:07,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472795358] [2022-04-06 09:40:07,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:07,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:07,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:07,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:07,226 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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-06 09:40:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:07,389 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-06 09:40:07,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:40:07,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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 49 [2022-04-06 09:40:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:07,389 INFO L225 Difference]: With dead ends: 75 [2022-04-06 09:40:07,389 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 09:40:07,390 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-06 09:40:07,390 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:07,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 09:40:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 09:40:07,391 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-06 09:40:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 09:40:07,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-06 09:40:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:07,391 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 09:40:07,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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-06 09:40:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 09:40:07,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 09:40:07,393 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-06 09:40:07,393 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-06 09:40:07,393 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-06 09:40:07,393 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-06 09:40:07,393 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-06 09:40:07,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-06 09:40:07,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-06 09:40:07,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 09:40:34,281 WARN L232 SmtUtils]: Spent 21.37s on a formula simplification. DAG size of input: 133 DAG size of output: 128 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-06 09:40:34,930 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 09:40:34,931 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-04-06 09:40:34,931 INFO L882 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L878 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L878 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (<= 1 main_~__VERIFIER_assert__cond~16) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5)))) [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-04-06 09:40:34,932 INFO L882 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L878 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (not (<= main_~main__urilen~0 main_~main__cp~0))) [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-04-06 09:40:34,933 INFO L882 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L878 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse8 (= main_~main__c~0 0)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (< main_~main__cp~0 main_~main__urilen~0)) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse9 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse10 (< 0 main_~main__scheme~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (<= 1 main_~main__cp~0)) (.cse13 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) (or (and .cse8 .cse15) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15))) (<= 1 main_~__VERIFIER_assert__cond~10)))) [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-04-06 09:40:34,934 INFO L878 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and .cse0 (= main_~main__c~0 0)) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0)))) [2022-04-06 09:40:34,934 INFO L882 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-04-06 09:40:34,935 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-04-06 09:40:34,937 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-06 09:40:34,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 09:40:34,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:40:34 BasicIcfg [2022-04-06 09:40:34,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 09:40:34,957 INFO L158 Benchmark]: Toolchain (without parser) took 33641.42ms. Allocated memory was 201.3MB in the beginning and 549.5MB in the end (delta: 348.1MB). Free memory was 148.1MB in the beginning and 414.7MB in the end (delta: -266.5MB). Peak memory consumption was 309.2MB. Max. memory is 8.0GB. [2022-04-06 09:40:34,957 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory was 164.6MB in the beginning and 164.5MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 09:40:34,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.56ms. Allocated memory was 201.3MB in the beginning and 316.7MB in the end (delta: 115.3MB). Free memory was 147.9MB in the beginning and 281.5MB in the end (delta: -133.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-06 09:40:34,957 INFO L158 Benchmark]: Boogie Preprocessor took 38.74ms. Allocated memory is still 316.7MB. Free memory was 281.5MB in the beginning and 280.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 09:40:34,957 INFO L158 Benchmark]: RCFGBuilder took 330.41ms. Allocated memory is still 316.7MB. Free memory was 279.5MB in the beginning and 263.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-06 09:40:34,958 INFO L158 Benchmark]: IcfgTransformer took 25.92ms. Allocated memory is still 316.7MB. Free memory was 263.8MB in the beginning and 261.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 09:40:34,958 INFO L158 Benchmark]: TraceAbstraction took 32916.25ms. Allocated memory was 316.7MB in the beginning and 549.5MB in the end (delta: 232.8MB). Free memory was 261.2MB in the beginning and 414.7MB in the end (delta: -153.5MB). Peak memory consumption was 306.3MB. Max. memory is 8.0GB. [2022-04-06 09:40:34,959 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 201.3MB. Free memory was 164.6MB in the beginning and 164.5MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 324.56ms. Allocated memory was 201.3MB in the beginning and 316.7MB in the end (delta: 115.3MB). Free memory was 147.9MB in the beginning and 281.5MB in the end (delta: -133.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.74ms. Allocated memory is still 316.7MB. Free memory was 281.5MB in the beginning and 280.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 330.41ms. Allocated memory is still 316.7MB. Free memory was 279.5MB in the beginning and 263.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 25.92ms. Allocated memory is still 316.7MB. Free memory was 263.8MB in the beginning and 261.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 32916.25ms. Allocated memory was 316.7MB in the beginning and 549.5MB in the end (delta: 232.8MB). Free memory was 261.2MB in the beginning and 414.7MB in the end (delta: -153.5MB). Peak memory consumption was 306.3MB. 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: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: 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: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: 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, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 32.9s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 27.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3678 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3678 mSDsluCounter, 1687 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2587 IncrementalHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1327 mSDtfsCounter, 2587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, 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, 298 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 732 HoareAnnotationTreeSize, 9 FomulaSimplifications, 75985 FormulaSimplificationTreeSizeReduction, 26.9s HoareSimplificationTime, 9 FomulaSimplificationsInter, 370018 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 12 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 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 18 specifications checked. All of them hold - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (\old(__return_375) == __return_375 && __VERIFIER_assert__cond == 1) && ((((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)) && main__c == 0) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && \old(__return_375) == __return_375) && ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(main__urilen <= main__cp) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) || (((main__c == 0 && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0))))) && 1 <= __VERIFIER_assert__cond) RESULT: Ultimate proved your program to be correct! [2022-04-06 09:40:34,995 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...