./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 00:58:39,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 00:58:39,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 00:58:39,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 00:58:39,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 00:58:39,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 00:58:39,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 00:58:39,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 00:58:39,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 00:58:39,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 00:58:39,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 00:58:39,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 00:58:39,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 00:58:39,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 00:58:39,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 00:58:39,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 00:58:39,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 00:58:39,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 00:58:39,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 00:58:39,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 00:58:39,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 00:58:39,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 00:58:39,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 00:58:39,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 00:58:39,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 00:58:39,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 00:58:39,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 00:58:39,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 00:58:39,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 00:58:39,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 00:58:39,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 00:58:39,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 00:58:39,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 00:58:39,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 00:58:39,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 00:58:39,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 00:58:39,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 00:58:39,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 00:58:39,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 00:58:39,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 00:58:39,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 00:58:39,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 00:58:39,586 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 00:58:39,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 00:58:39,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 00:58:39,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 00:58:39,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 00:58:39,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 00:58:39,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 00:58:39,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 00:58:39,588 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 00:58:39,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 00:58:39,589 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 00:58:39,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 00:58:39,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 00:58:39,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 00:58:39,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 00:58:39,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 00:58:39,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 00:58:39,590 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 00:58:39,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 00:58:39,590 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 00:58:39,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 00:58:39,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 00:58:39,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 00:58:39,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 00:58:39,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 00:58:39,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 00:58:39,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 00:58:39,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 00:58:39,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 00:58:39,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 00:58:39,592 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 00:58:39,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 00:58:39,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 00:58:39,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd [2021-12-28 00:58:39,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 00:58:39,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 00:58:39,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 00:58:39,806 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 00:58:39,806 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 00:58:39,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2021-12-28 00:58:39,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fb4ccc8/e74bf224ac564e3f838d238f654d4577/FLAGc4ccf82ea [2021-12-28 00:58:40,203 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 00:58:40,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2021-12-28 00:58:40,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fb4ccc8/e74bf224ac564e3f838d238f654d4577/FLAGc4ccf82ea [2021-12-28 00:58:40,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fb4ccc8/e74bf224ac564e3f838d238f654d4577 [2021-12-28 00:58:40,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 00:58:40,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 00:58:40,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 00:58:40,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 00:58:40,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 00:58:40,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b7327c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40, skipping insertion in model container [2021-12-28 00:58:40,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 00:58:40,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 00:58:40,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c[1168,1181] [2021-12-28 00:58:40,424 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 00:58:40,430 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 00:58:40,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c[1168,1181] [2021-12-28 00:58:40,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 00:58:40,458 INFO L208 MainTranslator]: Completed translation [2021-12-28 00:58:40,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40 WrapperNode [2021-12-28 00:58:40,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 00:58:40,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 00:58:40,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 00:58:40,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 00:58:40,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,525 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2021-12-28 00:58:40,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 00:58:40,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 00:58:40,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 00:58:40,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 00:58:40,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 00:58:40,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 00:58:40,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 00:58:40,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 00:58:40,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (1/1) ... [2021-12-28 00:58:40,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 00:58:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:40,617 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) [2021-12-28 00:58:40,646 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 [2021-12-28 00:58:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 00:58:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 00:58:40,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 00:58:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2021-12-28 00:58:40,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2021-12-28 00:58:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 00:58:40,715 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 00:58:40,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 00:58:40,795 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 00:58:40,800 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 00:58:40,800 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 00:58:40,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:40 BoogieIcfgContainer [2021-12-28 00:58:40,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 00:58:40,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 00:58:40,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 00:58:40,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 00:58:40,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:58:40" (1/3) ... [2021-12-28 00:58:40,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9a213a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:58:40, skipping insertion in model container [2021-12-28 00:58:40,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:40" (2/3) ... [2021-12-28 00:58:40,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9a213a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:58:40, skipping insertion in model container [2021-12-28 00:58:40,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:40" (3/3) ... [2021-12-28 00:58:40,807 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2021-12-28 00:58:40,810 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 00:58:40,811 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 00:58:40,841 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 00:58:40,857 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 00:58:40,857 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 00:58:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 00:58:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 00:58:40,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:40,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:40,873 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2021-12-28 00:58:40,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:40,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46306722] [2021-12-28 00:58:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:40,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:41,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:58:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 00:58:41,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:41,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46306722] [2021-12-28 00:58:41,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46306722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 00:58:41,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 00:58:41,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 00:58:41,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900926825] [2021-12-28 00:58:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 00:58:41,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 00:58:41,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:41,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 00:58:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 00:58:41,103 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 00:58:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:41,209 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2021-12-28 00:58:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 00:58:41,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-12-28 00:58:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:41,224 INFO L225 Difference]: With dead ends: 51 [2021-12-28 00:58:41,225 INFO L226 Difference]: Without dead ends: 25 [2021-12-28 00:58:41,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 00:58:41,242 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:41,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 00:58:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-28 00:58:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-28 00:58:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-28 00:58:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-12-28 00:58:41,287 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2021-12-28 00:58:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:41,287 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-12-28 00:58:41,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 00:58:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-12-28 00:58:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 00:58:41,291 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:41,291 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:41,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 00:58:41,293 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2021-12-28 00:58:41,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:41,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494411214] [2021-12-28 00:58:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:41,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:58:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:41,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 00:58:41,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:41,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494411214] [2021-12-28 00:58:41,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494411214] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:41,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585207422] [2021-12-28 00:58:41,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:41,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:41,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:41,418 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) [2021-12-28 00:58:41,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 00:58:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:41,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 00:58:41,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 00:58:41,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 00:58:41,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585207422] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:41,652 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:41,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-28 00:58:41,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416785534] [2021-12-28 00:58:41,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:41,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 00:58:41,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 00:58:41,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-28 00:58:41,657 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-28 00:58:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:41,786 INFO L93 Difference]: Finished difference Result 74 states and 126 transitions. [2021-12-28 00:58:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 00:58:41,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 19 [2021-12-28 00:58:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:41,789 INFO L225 Difference]: With dead ends: 74 [2021-12-28 00:58:41,789 INFO L226 Difference]: Without dead ends: 50 [2021-12-28 00:58:41,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-12-28 00:58:41,791 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:41,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 92 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 00:58:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-28 00:58:41,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-28 00:58:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2021-12-28 00:58:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2021-12-28 00:58:41,802 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 19 [2021-12-28 00:58:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:41,802 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2021-12-28 00:58:41,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-28 00:58:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2021-12-28 00:58:41,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 00:58:41,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:41,805 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:41,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 00:58:42,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:42,029 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash -574784801, now seen corresponding path program 1 times [2021-12-28 00:58:42,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:42,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296455286] [2021-12-28 00:58:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:42,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:42,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:58:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:42,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:42,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:42,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:42,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:42,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:58:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-28 00:58:42,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296455286] [2021-12-28 00:58:42,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296455286] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816215369] [2021-12-28 00:58:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:42,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:42,169 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) [2021-12-28 00:58:42,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 00:58:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:42,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 00:58:42,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-28 00:58:42,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-28 00:58:42,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816215369] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:42,692 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:42,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2021-12-28 00:58:42,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269393121] [2021-12-28 00:58:42,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:42,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 00:58:42,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 00:58:42,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-28 00:58:42,694 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-28 00:58:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:42,827 INFO L93 Difference]: Finished difference Result 120 states and 227 transitions. [2021-12-28 00:58:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 00:58:42,827 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) Word has length 45 [2021-12-28 00:58:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:42,829 INFO L225 Difference]: With dead ends: 120 [2021-12-28 00:58:42,829 INFO L226 Difference]: Without dead ends: 53 [2021-12-28 00:58:42,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-12-28 00:58:42,831 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:42,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 83 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 00:58:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-28 00:58:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-28 00:58:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2021-12-28 00:58:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2021-12-28 00:58:42,840 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 45 [2021-12-28 00:58:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:42,840 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2021-12-28 00:58:42,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 6 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 6 states have call successors, (9) [2021-12-28 00:58:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2021-12-28 00:58:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-28 00:58:42,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:42,843 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:42,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 00:58:43,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-28 00:58:43,060 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:43,060 INFO L85 PathProgramCache]: Analyzing trace with hash -749766204, now seen corresponding path program 2 times [2021-12-28 00:58:43,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:43,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011525266] [2021-12-28 00:58:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:43,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:58:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-28 00:58:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-28 00:58:43,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:43,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011525266] [2021-12-28 00:58:43,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011525266] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:43,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655582910] [2021-12-28 00:58:43,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 00:58:43,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:43,311 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) [2021-12-28 00:58:43,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 00:58:43,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 00:58:43,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:58:43,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 00:58:43,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-12-28 00:58:43,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-28 00:58:44,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655582910] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:44,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:44,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2021-12-28 00:58:44,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547512183] [2021-12-28 00:58:44,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:44,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-28 00:58:44,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:44,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-28 00:58:44,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2021-12-28 00:58:44,727 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2021-12-28 00:58:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:45,178 INFO L93 Difference]: Finished difference Result 119 states and 222 transitions. [2021-12-28 00:58:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 00:58:45,179 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 79 [2021-12-28 00:58:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:45,181 INFO L225 Difference]: With dead ends: 119 [2021-12-28 00:58:45,181 INFO L226 Difference]: Without dead ends: 71 [2021-12-28 00:58:45,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=438, Invalid=1724, Unknown=0, NotChecked=0, Total=2162 [2021-12-28 00:58:45,184 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:45,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 184 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 00:58:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-28 00:58:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2021-12-28 00:58:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2021-12-28 00:58:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2021-12-28 00:58:45,196 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 79 [2021-12-28 00:58:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:45,196 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2021-12-28 00:58:45,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 23 states have internal predecessors, (62), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2021-12-28 00:58:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2021-12-28 00:58:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-12-28 00:58:45,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:45,200 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:45,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 00:58:45,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:45,415 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash -714127218, now seen corresponding path program 3 times [2021-12-28 00:58:45,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:45,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324574729] [2021-12-28 00:58:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:45,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:58:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:58:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:58:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 00:58:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 338 proven. 129 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2021-12-28 00:58:45,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:45,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324574729] [2021-12-28 00:58:45,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324574729] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:45,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391252544] [2021-12-28 00:58:45,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 00:58:45,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:45,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 00:58:45,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 00:58:45,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-12-28 00:58:45,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:58:45,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 00:58:45,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 315 proven. 141 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-28 00:58:46,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 357 proven. 126 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2021-12-28 00:58:48,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391252544] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:48,868 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:48,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 25] total 41 [2021-12-28 00:58:48,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404119725] [2021-12-28 00:58:48,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:48,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-28 00:58:48,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:48,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-28 00:58:48,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1433, Unknown=0, NotChecked=0, Total=1640 [2021-12-28 00:58:48,871 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 41 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 33 states have internal predecessors, (78), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) [2021-12-28 00:58:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:49,729 INFO L93 Difference]: Finished difference Result 147 states and 279 transitions. [2021-12-28 00:58:49,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-28 00:58:49,729 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 33 states have internal predecessors, (78), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) Word has length 131 [2021-12-28 00:58:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:49,731 INFO L225 Difference]: With dead ends: 147 [2021-12-28 00:58:49,731 INFO L226 Difference]: Without dead ends: 92 [2021-12-28 00:58:49,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 279 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1123, Invalid=4883, Unknown=0, NotChecked=0, Total=6006 [2021-12-28 00:58:49,734 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:49,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 242 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 00:58:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-28 00:58:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2021-12-28 00:58:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2021-12-28 00:58:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2021-12-28 00:58:49,744 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 131 [2021-12-28 00:58:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:49,745 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2021-12-28 00:58:49,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 33 states have internal predecessors, (78), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) [2021-12-28 00:58:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2021-12-28 00:58:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-28 00:58:49,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:49,750 INFO L514 BasicCegarLoop]: trace histogram [27, 27, 16, 11, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:49,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 00:58:49,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:49,963 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1633021193, now seen corresponding path program 4 times [2021-12-28 00:58:49,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133191334] [2021-12-28 00:58:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:49,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:58:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:58:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 00:58:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:58:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 00:58:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 172 proven. 544 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2021-12-28 00:58:50,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:50,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133191334] [2021-12-28 00:58:50,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133191334] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:50,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559128746] [2021-12-28 00:58:50,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-28 00:58:50,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:50,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:50,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 00:58:50,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 00:58:50,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-28 00:58:50,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:58:50,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-28 00:58:50,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 451 proven. 191 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2021-12-28 00:58:50,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 451 proven. 225 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2021-12-28 00:58:52,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559128746] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:52,258 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:52,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 11] total 26 [2021-12-28 00:58:52,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455707425] [2021-12-28 00:58:52,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:52,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-28 00:58:52,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-28 00:58:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2021-12-28 00:58:52,260 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 23 states have internal predecessors, (76), 14 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (32), 16 states have call predecessors, (32), 14 states have call successors, (32) [2021-12-28 00:58:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:53,378 INFO L93 Difference]: Finished difference Result 195 states and 402 transitions. [2021-12-28 00:58:53,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-12-28 00:58:53,378 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 23 states have internal predecessors, (76), 14 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (32), 16 states have call predecessors, (32), 14 states have call successors, (32) Word has length 184 [2021-12-28 00:58:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:53,381 INFO L225 Difference]: With dead ends: 195 [2021-12-28 00:58:53,381 INFO L226 Difference]: Without dead ends: 70 [2021-12-28 00:58:53,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1268, Invalid=4894, Unknown=0, NotChecked=0, Total=6162 [2021-12-28 00:58:53,384 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 82 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:53,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 178 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 00:58:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-28 00:58:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2021-12-28 00:58:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (18), 13 states have call predecessors, (18), 10 states have call successors, (18) [2021-12-28 00:58:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2021-12-28 00:58:53,391 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 184 [2021-12-28 00:58:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:53,391 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2021-12-28 00:58:53,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 23 states have internal predecessors, (76), 14 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (32), 16 states have call predecessors, (32), 14 states have call successors, (32) [2021-12-28 00:58:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2021-12-28 00:58:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-28 00:58:53,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:53,396 INFO L514 BasicCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:53,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-28 00:58:53,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:53,597 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1701842998, now seen corresponding path program 5 times [2021-12-28 00:58:53,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:53,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479652236] [2021-12-28 00:58:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:53,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:58:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:58:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:58:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 00:58:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:58:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:58:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 446 proven. 274 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2021-12-28 00:58:53,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479652236] [2021-12-28 00:58:53,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479652236] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589586784] [2021-12-28 00:58:53,958 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-28 00:58:53,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:53,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 00:58:53,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 00:58:54,091 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2021-12-28 00:58:54,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:58:54,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-28 00:58:54,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2021-12-28 00:58:54,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2021-12-28 00:58:57,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589586784] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:57,136 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:57,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 27] total 37 [2021-12-28 00:58:57,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394561014] [2021-12-28 00:58:57,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:57,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-28 00:58:57,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-28 00:58:57,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2021-12-28 00:58:57,138 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2021-12-28 00:58:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:57,703 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2021-12-28 00:58:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-28 00:58:57,704 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) Word has length 157 [2021-12-28 00:58:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:57,706 INFO L225 Difference]: With dead ends: 140 [2021-12-28 00:58:57,706 INFO L226 Difference]: Without dead ends: 83 [2021-12-28 00:58:57,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 343 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=847, Invalid=3709, Unknown=0, NotChecked=0, Total=4556 [2021-12-28 00:58:57,708 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:57,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 251 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 00:58:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-28 00:58:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2021-12-28 00:58:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 11 states have call successors, (11), 5 states have call predecessors, (11), 10 states have return successors, (22), 15 states have call predecessors, (22), 11 states have call successors, (22) [2021-12-28 00:58:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2021-12-28 00:58:57,718 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 157 [2021-12-28 00:58:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:57,719 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2021-12-28 00:58:57,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 31 states have internal predecessors, (82), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2021-12-28 00:58:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2021-12-28 00:58:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-12-28 00:58:57,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:57,721 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:57,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-28 00:58:57,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:57,941 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:57,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:57,941 INFO L85 PathProgramCache]: Analyzing trace with hash -860565711, now seen corresponding path program 6 times [2021-12-28 00:58:57,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:57,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118081975] [2021-12-28 00:58:57,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:57,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:58:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:58:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:58:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 00:58:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:58:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:58:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:58:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 00:58:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2021-12-28 00:58:58,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:58,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118081975] [2021-12-28 00:58:58,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118081975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:58,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395378157] [2021-12-28 00:58:58,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-28 00:58:58,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:58,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:58,520 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 00:58:58,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 00:58:58,738 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2021-12-28 00:58:58,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:58:58,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-28 00:58:58,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2021-12-28 00:58:58,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:59:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2021-12-28 00:59:01,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395378157] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:59:01,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:59:01,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 34 [2021-12-28 00:59:01,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181035308] [2021-12-28 00:59:01,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:59:01,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-28 00:59:01,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:59:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-28 00:59:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2021-12-28 00:59:01,483 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2021-12-28 00:59:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:59:02,148 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2021-12-28 00:59:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-28 00:59:02,148 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 170 [2021-12-28 00:59:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:59:02,151 INFO L225 Difference]: With dead ends: 158 [2021-12-28 00:59:02,151 INFO L226 Difference]: Without dead ends: 96 [2021-12-28 00:59:02,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 376 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=955, Invalid=3875, Unknown=0, NotChecked=0, Total=4830 [2021-12-28 00:59:02,154 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 75 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 00:59:02,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 271 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 00:59:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-28 00:59:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2021-12-28 00:59:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.125) internal successors, (54), 49 states have internal predecessors, (54), 12 states have call successors, (12), 5 states have call predecessors, (12), 11 states have return successors, (26), 17 states have call predecessors, (26), 12 states have call successors, (26) [2021-12-28 00:59:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2021-12-28 00:59:02,180 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 170 [2021-12-28 00:59:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:59:02,180 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2021-12-28 00:59:02,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2021-12-28 00:59:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2021-12-28 00:59:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-12-28 00:59:02,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:59:02,183 INFO L514 BasicCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:59:02,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-28 00:59:02,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:59:02,392 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:59:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:59:02,392 INFO L85 PathProgramCache]: Analyzing trace with hash 332854534, now seen corresponding path program 7 times [2021-12-28 00:59:02,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:59:02,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325914695] [2021-12-28 00:59:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:59:02,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:59:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:59:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:59:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 00:59:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 00:59:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 00:59:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2021-12-28 00:59:02,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:59:02,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325914695] [2021-12-28 00:59:02,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325914695] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:59:02,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610843183] [2021-12-28 00:59:02,940 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-28 00:59:02,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:59:02,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:59:02,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 00:59:02,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 00:59:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:03,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-28 00:59:03,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:59:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2021-12-28 00:59:03,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:59:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 597 proven. 189 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2021-12-28 00:59:05,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610843183] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:59:05,237 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:59:05,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 36 [2021-12-28 00:59:05,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476966193] [2021-12-28 00:59:05,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:59:05,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-28 00:59:05,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:59:05,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-28 00:59:05,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2021-12-28 00:59:05,239 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2021-12-28 00:59:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:59:07,723 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2021-12-28 00:59:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-12-28 00:59:07,724 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) Word has length 183 [2021-12-28 00:59:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:59:07,725 INFO L225 Difference]: With dead ends: 146 [2021-12-28 00:59:07,725 INFO L226 Difference]: Without dead ends: 130 [2021-12-28 00:59:07,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 404 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=880, Invalid=6260, Unknown=0, NotChecked=0, Total=7140 [2021-12-28 00:59:07,727 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-28 00:59:07,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 536 Invalid, 2783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-28 00:59:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-28 00:59:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2021-12-28 00:59:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 58 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 13 states have return successors, (37), 21 states have call predecessors, (37), 15 states have call successors, (37) [2021-12-28 00:59:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2021-12-28 00:59:07,735 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 183 [2021-12-28 00:59:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:59:07,739 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2021-12-28 00:59:07,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2021-12-28 00:59:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2021-12-28 00:59:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-12-28 00:59:07,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:59:07,741 INFO L514 BasicCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:59:07,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 00:59:07,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-12-28 00:59:07,962 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:59:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:59:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash 530318069, now seen corresponding path program 8 times [2021-12-28 00:59:07,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:59:07,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330678057] [2021-12-28 00:59:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:59:07,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:59:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:59:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:59:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 00:59:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 00:59:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 00:59:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 00:59:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2021-12-28 00:59:08,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:59:08,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330678057] [2021-12-28 00:59:08,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330678057] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:59:08,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381183173] [2021-12-28 00:59:08,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 00:59:08,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:59:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:59:08,408 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 00:59:08,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-28 00:59:08,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 00:59:08,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:59:08,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-28 00:59:08,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:59:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2021-12-28 00:59:08,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:59:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 685 proven. 580 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2021-12-28 00:59:12,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381183173] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:59:12,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:59:12,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 32] total 38 [2021-12-28 00:59:12,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564249725] [2021-12-28 00:59:12,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:59:12,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-28 00:59:12,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:59:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-28 00:59:12,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2021-12-28 00:59:12,387 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2021-12-28 00:59:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:59:12,871 INFO L93 Difference]: Finished difference Result 208 states and 286 transitions. [2021-12-28 00:59:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-28 00:59:12,872 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) Word has length 196 [2021-12-28 00:59:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:59:12,873 INFO L225 Difference]: With dead ends: 208 [2021-12-28 00:59:12,873 INFO L226 Difference]: Without dead ends: 127 [2021-12-28 00:59:12,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 434 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=759, Invalid=3147, Unknown=0, NotChecked=0, Total=3906 [2021-12-28 00:59:12,875 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 131 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 00:59:12,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 344 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 00:59:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-28 00:59:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2021-12-28 00:59:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 16 states have call successors, (16), 6 states have call predecessors, (16), 14 states have return successors, (39), 23 states have call predecessors, (39), 16 states have call successors, (39) [2021-12-28 00:59:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2021-12-28 00:59:12,884 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 196 [2021-12-28 00:59:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:59:12,885 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2021-12-28 00:59:12,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 34 states have internal predecessors, (95), 21 states have call successors, (24), 1 states have call predecessors, (24), 20 states have return successors, (45), 18 states have call predecessors, (45), 21 states have call successors, (45) [2021-12-28 00:59:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2021-12-28 00:59:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-28 00:59:12,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:59:12,887 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:59:12,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-28 00:59:13,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-28 00:59:13,105 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:59:13,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:59:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash 660925528, now seen corresponding path program 9 times [2021-12-28 00:59:13,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:59:13,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262333410] [2021-12-28 00:59:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:59:13,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:59:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:59:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:59:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 00:59:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 00:59:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 00:59:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 00:59:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 00:59:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 268 proven. 783 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2021-12-28 00:59:13,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:59:13,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262333410] [2021-12-28 00:59:13,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262333410] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:59:13,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520503793] [2021-12-28 00:59:13,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 00:59:13,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:59:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:59:13,448 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 00:59:13,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-28 00:59:13,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2021-12-28 00:59:13,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:59:13,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 00:59:13,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:59:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2021-12-28 00:59:14,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:59:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 274 proven. 806 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2021-12-28 00:59:16,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520503793] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:59:16,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:59:16,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 27 [2021-12-28 00:59:16,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028252883] [2021-12-28 00:59:16,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:59:16,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-28 00:59:16,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:59:16,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-28 00:59:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2021-12-28 00:59:16,038 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2021-12-28 00:59:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:59:16,336 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2021-12-28 00:59:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 00:59:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) Word has length 209 [2021-12-28 00:59:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:59:16,338 INFO L225 Difference]: With dead ends: 183 [2021-12-28 00:59:16,338 INFO L226 Difference]: Without dead ends: 97 [2021-12-28 00:59:16,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 468 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2021-12-28 00:59:16,340 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 00:59:16,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 230 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 00:59:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-28 00:59:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2021-12-28 00:59:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 15 states have call successors, (15), 6 states have call predecessors, (15), 13 states have return successors, (30), 21 states have call predecessors, (30), 15 states have call successors, (30) [2021-12-28 00:59:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2021-12-28 00:59:16,355 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 209 [2021-12-28 00:59:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:59:16,356 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2021-12-28 00:59:16,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 16 states have call successors, (22), 2 states have call predecessors, (22), 14 states have return successors, (36), 13 states have call predecessors, (36), 16 states have call successors, (36) [2021-12-28 00:59:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2021-12-28 00:59:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2021-12-28 00:59:16,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:59:16,357 INFO L514 BasicCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:59:16,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-28 00:59:16,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-28 00:59:16,562 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:59:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:59:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash 471385981, now seen corresponding path program 10 times [2021-12-28 00:59:16,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:59:16,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666141389] [2021-12-28 00:59:16,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:59:16,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:59:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 00:59:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:59:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 00:59:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 00:59:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 00:59:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-28 00:59:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:59:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 00:59:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 00:59:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 00:59:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 00:59:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 00:59:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 00:59:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:59:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 228 proven. 513 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2021-12-28 00:59:16,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:59:16,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666141389] [2021-12-28 00:59:16,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666141389] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:59:16,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123563754] [2021-12-28 00:59:16,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-28 00:59:16,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:59:16,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:59:16,952 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 00:59:16,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-28 00:59:17,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-28 00:59:17,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:59:17,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 00:59:17,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:59:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 507 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2021-12-28 00:59:17,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:59:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 234 proven. 522 refuted. 0 times theorem prover too weak. 3573 trivial. 0 not checked. [2021-12-28 00:59:18,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123563754] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:59:18,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:59:18,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2021-12-28 00:59:18,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245359813] [2021-12-28 00:59:18,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:59:18,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 00:59:18,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:59:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 00:59:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-28 00:59:18,341 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2021-12-28 00:59:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:59:18,395 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2021-12-28 00:59:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 00:59:18,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) Word has length 281 [2021-12-28 00:59:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:59:18,397 INFO L225 Difference]: With dead ends: 89 [2021-12-28 00:59:18,397 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 00:59:18,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 639 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-12-28 00:59:18,398 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 00:59:18,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 91 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 00:59:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 00:59:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 00:59:18,398 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) [2021-12-28 00:59:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 00:59:18,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2021-12-28 00:59:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:59:18,399 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 00:59:18,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 11 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2021-12-28 00:59:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 00:59:18,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 00:59:18,401 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 00:59:18,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-28 00:59:18,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-28 00:59:18,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L861 garLoopResultBuilder]: At program point L27(lines 27 47) the Hoare annotation is: true [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L861 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2021-12-28 00:59:27,816 INFO L858 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2021-12-28 00:59:27,817 INFO L854 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2021-12-28 00:59:27,817 INFO L858 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2021-12-28 00:59:27,817 INFO L861 garLoopResultBuilder]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2021-12-28 00:59:27,817 INFO L854 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2021-12-28 00:59:27,817 INFO L854 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse14 (= |ackermann_#in~m| 0)) (.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse5 (= ackermann_~m |ackermann_#in~m|))) (let ((.cse8 (<= 4 |ackermann_#t~ret5|)) (.cse9 (and .cse14 .cse3 .cse5)) (.cse2 (<= 3 |ackermann_#t~ret5|)) (.cse6 (<= ackermann_~m 1))) (and (let ((.cse7 (<= 3 |ackermann_#in~n|)) (.cse4 (<= 1 |ackermann_#in~m|)) (.cse0 (<= 5 |ackermann_#t~ret5|)) (.cse1 (<= |ackermann_#t~ret5| 5)) (.cse11 (<= 2 |ackermann_#in~n|)) (.cse10 (<= 2 |ackermann_#in~m|)) (.cse12 (<= |ackermann_#t~ret5| 3))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 4 |ackermann_#in~n|) .cse4 .cse5 (<= |ackermann_#in~n| 4) .cse6) (and (<= |ackermann_#in~n| 3) (<= |ackermann_#t~ret5| 4) .cse2 .cse3 .cse7 .cse4 .cse5 .cse6 .cse8) .cse9 (and .cse0 .cse10 .cse7) (<= 3 |ackermann_#in~m|) (and (<= |ackermann_#t~ret5| 2) .cse4) (and (<= |ackermann_#in~n| 2) .cse11 .cse4 .cse12) (and (<= 6 |ackermann_#t~ret5|) .cse0 .cse2 .cse3 (<= |ackermann_#t~ret5| 6) .cse4 .cse5 .cse6 (<= 5 |ackermann_#in~n|)) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 6 |ackermann_#in~n|)) (and .cse0 .cse1 .cse10 .cse11) (and .cse10 .cse12))) (let ((.cse13 (< |ackermann_#in~n| 2))) (or (and .cse3 .cse5 .cse8) .cse9 (and .cse2 .cse3 .cse13 .cse5) (and .cse3 .cse13 (<= 2 |ackermann_#t~ret5|) .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6))) (or .cse14 (not (<= |ackermann_#in~n| 0)))))) [2021-12-28 00:59:27,817 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2021-12-28 00:59:27,817 INFO L858 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2021-12-28 00:59:27,817 INFO L858 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2021-12-28 00:59:27,817 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2021-12-28 00:59:27,817 INFO L858 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2021-12-28 00:59:27,819 INFO L732 BasicCegarLoop]: Path program histogram: [10, 1, 1] [2021-12-28 00:59:27,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 00:59:27,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:59:27 BoogieIcfgContainer [2021-12-28 00:59:27,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 00:59:27,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 00:59:27,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 00:59:27,825 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 00:59:27,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:40" (3/4) ... [2021-12-28 00:59:27,827 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 00:59:27,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2021-12-28 00:59:27,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-28 00:59:27,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-28 00:59:27,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-28 00:59:27,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-28 00:59:27,855 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 00:59:27,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 00:59:27,856 INFO L158 Benchmark]: Toolchain (without parser) took 47632.16ms. Allocated memory was 46.1MB in the beginning and 608.2MB in the end (delta: 562.0MB). Free memory was 22.3MB in the beginning and 287.5MB in the end (delta: -265.2MB). Peak memory consumption was 296.7MB. Max. memory is 16.1GB. [2021-12-28 00:59:27,856 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.3MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 00:59:27,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.96ms. Allocated memory is still 65.0MB. Free memory was 50.0MB in the beginning and 40.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-28 00:59:27,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.72ms. Allocated memory is still 65.0MB. Free memory was 40.4MB in the beginning and 49.2MB in the end (delta: -8.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-28 00:59:27,857 INFO L158 Benchmark]: Boogie Preprocessor took 29.11ms. Allocated memory is still 65.0MB. Free memory was 49.2MB in the beginning and 48.4MB in the end (delta: 777.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 00:59:27,857 INFO L158 Benchmark]: RCFGBuilder took 245.03ms. Allocated memory is still 65.0MB. Free memory was 48.2MB in the beginning and 39.1MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-28 00:59:27,857 INFO L158 Benchmark]: TraceAbstraction took 47022.21ms. Allocated memory was 65.0MB in the beginning and 608.2MB in the end (delta: 543.2MB). Free memory was 38.7MB in the beginning and 290.6MB in the end (delta: -251.9MB). Peak memory consumption was 376.8MB. Max. memory is 16.1GB. [2021-12-28 00:59:27,857 INFO L158 Benchmark]: Witness Printer took 30.56ms. Allocated memory is still 608.2MB. Free memory was 290.6MB in the beginning and 287.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 00:59:27,858 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.16ms. Allocated memory is still 46.1MB. Free memory was 28.4MB in the beginning and 28.3MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.96ms. Allocated memory is still 65.0MB. Free memory was 50.0MB in the beginning and 40.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.72ms. Allocated memory is still 65.0MB. Free memory was 40.4MB in the beginning and 49.2MB in the end (delta: -8.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.11ms. Allocated memory is still 65.0MB. Free memory was 49.2MB in the beginning and 48.4MB in the end (delta: 777.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 245.03ms. Allocated memory is still 65.0MB. Free memory was 48.2MB in the beginning and 39.1MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 47022.21ms. Allocated memory was 65.0MB in the beginning and 608.2MB in the end (delta: 543.2MB). Free memory was 38.7MB in the beginning and 290.6MB in the end (delta: -251.9MB). Peak memory consumption was 376.8MB. Max. memory is 16.1GB. * Witness Printer took 30.56ms. Allocated memory is still 608.2MB. Free memory was 290.6MB in the beginning and 287.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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: 45]: 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 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.0s, OverallIterations: 12, TraceHistogramMax: 42, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 727 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 675 mSDsluCounter, 2575 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2240 mSDsCounter, 2145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7237 IncrementalHoareTripleChecker+Invalid, 9382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2145 mSolverCounterUnsat, 335 mSDtfsCounter, 7237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4265 GetRequests, 3668 SyntacticMatches, 36 SemanticMatches, 561 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8020 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=10, InterpolantAutomatonStates: 342, 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, 12 MinimizatonAttempts, 192 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 526 PreInvPairs, 1368 NumberOfFragments, 262 HoareAnnotationTreeSize, 526 FomulaSimplifications, 73852 FormulaSimplificationTreeSizeReduction, 7.5s HoareSimplificationTime, 6 FomulaSimplificationsInter, 592947 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 25.2s InterpolantComputationTime, 3320 NumberOfCodeBlocks, 3193 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 4940 ConstructedInterpolants, 0 QuantifiedInterpolants, 9952 SizeOfPredicates, 86 NumberOfNonLiveVariables, 4656 ConjunctsInSsa, 305 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 39129/48132 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 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-28 00:59:27,884 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE