./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 35987657 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-?-3598765 [2022-07-21 05:02:57,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:02:57,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:02:57,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:02:57,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:02:57,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:02:57,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:02:57,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:02:57,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:02:57,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:02:57,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:02:57,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:02:57,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:02:57,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:02:57,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:02:57,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:02:57,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:02:57,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:02:57,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:02:57,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:02:57,149 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:02:57,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:02:57,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:02:57,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:02:57,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:02:57,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:02:57,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:02:57,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:02:57,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:02:57,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:02:57,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:02:57,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:02:57,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:02:57,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:02:57,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:02:57,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:02:57,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:02:57,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:02:57,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:02:57,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:02:57,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:02:57,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:02:57,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:02:57,189 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:02:57,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:02:57,190 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:02:57,190 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:02:57,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:02:57,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:02:57,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:02:57,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:02:57,191 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:02:57,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:02:57,192 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:02:57,192 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:02:57,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:02:57,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:02:57,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:02:57,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:02:57,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:02:57,193 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:02:57,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:02:57,194 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:02:57,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:02:57,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:02:57,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:02:57,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:02:57,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:02:57,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:02:57,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:02:57,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:02:57,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:02:57,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:02:57,195 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:02:57,195 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:02:57,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:02:57,196 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 [2022-07-21 05:02:57,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:02:57,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:02:57,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:02:57,502 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:02:57,502 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:02:57,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2022-07-21 05:02:57,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed469727/1e6b6a0c97c94245b7282dc2c4f1acfc/FLAG310adee60 [2022-07-21 05:02:57,856 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:02:57,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2022-07-21 05:02:57,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed469727/1e6b6a0c97c94245b7282dc2c4f1acfc/FLAG310adee60 [2022-07-21 05:02:58,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed469727/1e6b6a0c97c94245b7282dc2c4f1acfc [2022-07-21 05:02:58,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:02:58,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:02:58,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:02:58,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:02:58,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:02:58,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515555bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58, skipping insertion in model container [2022-07-21 05:02:58,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:02:58,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:02:58,442 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] [2022-07-21 05:02:58,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:02:58,450 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:02:58,464 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] [2022-07-21 05:02:58,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:02:58,515 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:02:58,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58 WrapperNode [2022-07-21 05:02:58,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:02:58,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:02:58,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:02:58,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:02:58,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,544 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-07-21 05:02:58,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:02:58,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:02:58,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:02:58,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:02:58,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:02:58,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:02:58,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:02:58,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:02:58,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (1/1) ... [2022-07-21 05:02:58,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:02:58,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:02:58,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 05:02:58,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 05:02:58,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:02:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:02:58,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:02:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2022-07-21 05:02:58,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2022-07-21 05:02:58,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:02:58,719 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:02:58,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:02:58,849 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:02:58,853 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:02:58,853 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 05:02:58,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:02:58 BoogieIcfgContainer [2022-07-21 05:02:58,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:02:58,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:02:58,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:02:58,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:02:58,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:02:58" (1/3) ... [2022-07-21 05:02:58,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28037cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:02:58, skipping insertion in model container [2022-07-21 05:02:58,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:02:58" (2/3) ... [2022-07-21 05:02:58,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28037cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:02:58, skipping insertion in model container [2022-07-21 05:02:58,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:02:58" (3/3) ... [2022-07-21 05:02:58,860 INFO L111 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2022-07-21 05:02:58,870 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:02:58,883 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:02:58,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:02:58,923 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2947c19a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a26c080 [2022-07-21 05:02:58,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:02:58,937 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) [2022-07-21 05:02:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 05:02:58,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:02:58,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:02:58,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:02:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:02:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times [2022-07-21 05:02:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:02:58,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225125896] [2022-07-21 05:02:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:02:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:02:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:02:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:02:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:02:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:02:59,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:02:59,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225125896] [2022-07-21 05:02:59,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225125896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:02:59,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:02:59,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:02:59,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169971463] [2022-07-21 05:02:59,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:02:59,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:02:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:02:59,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:02:59,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:02:59,173 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) [2022-07-21 05:02:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:02:59,274 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-07-21 05:02:59,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:02:59,276 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 [2022-07-21 05:02:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:02:59,281 INFO L225 Difference]: With dead ends: 51 [2022-07-21 05:02:59,281 INFO L226 Difference]: Without dead ends: 25 [2022-07-21 05:02:59,283 INFO L412 NwaCegarLoop]: 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 [2022-07-21 05:02:59,286 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:02:59,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:02:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-21 05:02:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-21 05:02:59,310 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) [2022-07-21 05:02:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-07-21 05:02:59,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2022-07-21 05:02:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:02:59,313 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-07-21 05:02:59,313 INFO L496 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) [2022-07-21 05:02:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-07-21 05:02:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 05:02:59,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:02:59,315 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:02:59,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:02:59,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:02:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:02:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times [2022-07-21 05:02:59,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:02:59,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572719720] [2022-07-21 05:02:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:02:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:02:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:02:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:02:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:02:59,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:02:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:02:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:02:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:02:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572719720] [2022-07-21 05:02:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572719720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:02:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813694768] [2022-07-21 05:02:59,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:02:59,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:02:59,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:02:59,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:02:59,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 05:02:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:02:59,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 05:02:59,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:02:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:02:59,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:02:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 05:02:59,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813694768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:02:59,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:02:59,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-21 05:02:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506201021] [2022-07-21 05:02:59,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:02:59,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 05:02:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:02:59,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 05:02:59,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-21 05:02:59,637 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) [2022-07-21 05:02:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:02:59,777 INFO L93 Difference]: Finished difference Result 74 states and 126 transitions. [2022-07-21 05:02:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:02:59,777 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 [2022-07-21 05:02:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:02:59,779 INFO L225 Difference]: With dead ends: 74 [2022-07-21 05:02:59,779 INFO L226 Difference]: Without dead ends: 50 [2022-07-21 05:02:59,781 INFO L412 NwaCegarLoop]: 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 [2022-07-21 05:02:59,782 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:02:59,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 91 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:02:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-21 05:02:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-21 05:02:59,797 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) [2022-07-21 05:02:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2022-07-21 05:02:59,802 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 19 [2022-07-21 05:02:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:02:59,802 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2022-07-21 05:02:59,802 INFO L496 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) [2022-07-21 05:02:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2022-07-21 05:02:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 05:02:59,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:02:59,807 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:02:59,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 05:03:00,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:00,008 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:00,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash -574784801, now seen corresponding path program 1 times [2022-07-21 05:03:00,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:00,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756590688] [2022-07-21 05:03:00,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:00,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:00,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:00,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:00,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:00,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 05:03:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:00,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756590688] [2022-07-21 05:03:00,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756590688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:00,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697745265] [2022-07-21 05:03:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:00,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:00,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:00,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:03:00,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 05:03:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:00,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:03:00,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-21 05:03:00,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-21 05:03:00,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697745265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:00,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:00,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-07-21 05:03:00,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507485992] [2022-07-21 05:03:00,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:00,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 05:03:00,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 05:03:00,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:03:00,674 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) [2022-07-21 05:03:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:00,784 INFO L93 Difference]: Finished difference Result 120 states and 227 transitions. [2022-07-21 05:03:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 05:03:00,785 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 [2022-07-21 05:03:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:00,791 INFO L225 Difference]: With dead ends: 120 [2022-07-21 05:03:00,791 INFO L226 Difference]: Without dead ends: 53 [2022-07-21 05:03:00,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:03:00,798 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:00,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 82 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:03:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-21 05:03:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-21 05:03:00,814 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) [2022-07-21 05:03:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2022-07-21 05:03:00,816 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 45 [2022-07-21 05:03:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:00,817 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2022-07-21 05:03:00,817 INFO L496 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) [2022-07-21 05:03:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2022-07-21 05:03:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-21 05:03:00,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:00,824 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:03:00,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:01,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-21 05:03:01,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:01,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash -749766204, now seen corresponding path program 2 times [2022-07-21 05:03:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:01,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977543870] [2022-07-21 05:03:01,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:01,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 05:03:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 05:03:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:01,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977543870] [2022-07-21 05:03:01,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977543870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:01,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952420311] [2022-07-21 05:03:01,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:03:01,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:01,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:01,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:03:01,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 05:03:01,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:03:01,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:01,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 05:03:01,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-21 05:03:01,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-21 05:03:02,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952420311] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:02,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:02,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2022-07-21 05:03:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33860049] [2022-07-21 05:03:02,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:02,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 05:03:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:02,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 05:03:02,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2022-07-21 05:03:02,845 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) [2022-07-21 05:03:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:03,169 INFO L93 Difference]: Finished difference Result 106 states and 183 transitions. [2022-07-21 05:03:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 05:03:03,170 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 [2022-07-21 05:03:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:03,172 INFO L225 Difference]: With dead ends: 106 [2022-07-21 05:03:03,172 INFO L226 Difference]: Without dead ends: 58 [2022-07-21 05:03:03,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1342, Unknown=0, NotChecked=0, Total=1640 [2022-07-21 05:03:03,173 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:03,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 183 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:03:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-21 05:03:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-07-21 05:03:03,179 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) [2022-07-21 05:03:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2022-07-21 05:03:03,180 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 79 [2022-07-21 05:03:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:03,181 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2022-07-21 05:03:03,181 INFO L496 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) [2022-07-21 05:03:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2022-07-21 05:03:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 05:03:03,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:03,184 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:03,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:03,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:03,401 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:03,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:03,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2109661843, now seen corresponding path program 3 times [2022-07-21 05:03:03,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:03,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664831363] [2022-07-21 05:03:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:03,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 05:03:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 391 proven. 197 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-21 05:03:03,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:03,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664831363] [2022-07-21 05:03:03,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664831363] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:03,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104225644] [2022-07-21 05:03:03,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:03:03,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:03,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:03,782 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) [2022-07-21 05:03:03,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 05:03:03,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-07-21 05:03:03,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:03,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 05:03:03,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 367 proven. 209 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-07-21 05:03:03,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 410 proven. 201 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-07-21 05:03:06,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104225644] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:06,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:06,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 26] total 39 [2022-07-21 05:03:06,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045682259] [2022-07-21 05:03:06,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:06,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-21 05:03:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-21 05:03:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1293, Unknown=0, NotChecked=0, Total=1482 [2022-07-21 05:03:06,458 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) [2022-07-21 05:03:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:07,133 INFO L93 Difference]: Finished difference Result 128 states and 237 transitions. [2022-07-21 05:03:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-21 05:03:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) Word has length 144 [2022-07-21 05:03:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:07,136 INFO L225 Difference]: With dead ends: 128 [2022-07-21 05:03:07,136 INFO L226 Difference]: Without dead ends: 80 [2022-07-21 05:03:07,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 311 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=799, Invalid=3623, Unknown=0, NotChecked=0, Total=4422 [2022-07-21 05:03:07,138 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 68 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:07,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 273 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:03:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-21 05:03:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-07-21 05:03:07,145 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, (35), 15 states have call predecessors, (35), 11 states have call successors, (35) [2022-07-21 05:03:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2022-07-21 05:03:07,146 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 144 [2022-07-21 05:03:07,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:07,147 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2022-07-21 05:03:07,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 32 states have internal predecessors, (80), 15 states have call successors, (18), 1 states have call predecessors, (18), 18 states have return successors, (33), 19 states have call predecessors, (33), 15 states have call successors, (33) [2022-07-21 05:03:07,147 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2022-07-21 05:03:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-21 05:03:07,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:07,148 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:03:07,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:07,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:07,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1942933932, now seen corresponding path program 4 times [2022-07-21 05:03:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:07,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317804012] [2022-07-21 05:03:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 05:03:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 258 proven. 609 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2022-07-21 05:03:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317804012] [2022-07-21 05:03:07,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317804012] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:07,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969499662] [2022-07-21 05:03:07,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 05:03:07,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:07,744 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) [2022-07-21 05:03:07,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 05:03:07,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 05:03:07,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:07,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 05:03:07,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 1016 proven. 196 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-07-21 05:03:07,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 264 proven. 632 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2022-07-21 05:03:09,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969499662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:09,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:09,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 21] total 27 [2022-07-21 05:03:09,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778132242] [2022-07-21 05:03:09,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:09,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-21 05:03:09,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:09,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-21 05:03:09,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-07-21 05:03:09,682 INFO L87 Difference]: Start difference. First operand 67 states and 97 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) [2022-07-21 05:03:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:09,934 INFO L93 Difference]: Finished difference Result 152 states and 268 transitions. [2022-07-21 05:03:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 05:03:09,934 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 183 [2022-07-21 05:03:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:09,937 INFO L225 Difference]: With dead ends: 152 [2022-07-21 05:03:09,937 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 05:03:09,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 408 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-07-21 05:03:09,939 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 41 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:09,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 257 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:03:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 05:03:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-21 05:03:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 57 states have internal predecessors, (61), 14 states have call successors, (14), 5 states have call predecessors, (14), 14 states have return successors, (62), 22 states have call predecessors, (62), 14 states have call successors, (62) [2022-07-21 05:03:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2022-07-21 05:03:09,959 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 183 [2022-07-21 05:03:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:09,960 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 137 transitions. [2022-07-21 05:03:09,961 INFO L496 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) [2022-07-21 05:03:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 137 transitions. [2022-07-21 05:03:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-21 05:03:09,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:09,965 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 16, 12, 11, 11, 11, 11, 11, 11, 11, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:09,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:10,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:10,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:10,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash 66624188, now seen corresponding path program 5 times [2022-07-21 05:03:10,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:10,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823747305] [2022-07-21 05:03:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 05:03:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 05:03:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 05:03:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 327 proven. 605 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2022-07-21 05:03:10,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:10,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823747305] [2022-07-21 05:03:10,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823747305] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:10,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188799957] [2022-07-21 05:03:10,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 05:03:10,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:10,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:10,425 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) [2022-07-21 05:03:10,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 05:03:10,577 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-21 05:03:10,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:10,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:03:10,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 1065 proven. 18 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2022-07-21 05:03:10,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1872 backedges. 324 proven. 328 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2022-07-21 05:03:11,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188799957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:11,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:11,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 20 [2022-07-21 05:03:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578960873] [2022-07-21 05:03:11,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:11,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 05:03:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 05:03:11,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-21 05:03:11,443 INFO L87 Difference]: Start difference. First operand 85 states and 137 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (30), 13 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-21 05:03:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:11,637 INFO L93 Difference]: Finished difference Result 203 states and 456 transitions. [2022-07-21 05:03:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 05:03:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (30), 13 states have call predecessors, (30), 9 states have call successors, (30) Word has length 190 [2022-07-21 05:03:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:11,639 INFO L225 Difference]: With dead ends: 203 [2022-07-21 05:03:11,639 INFO L226 Difference]: Without dead ends: 123 [2022-07-21 05:03:11,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2022-07-21 05:03:11,641 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 95 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:11,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 166 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:03:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-21 05:03:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-07-21 05:03:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 19 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (77), 24 states have call predecessors, (77), 19 states have call successors, (77) [2022-07-21 05:03:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 173 transitions. [2022-07-21 05:03:11,658 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 173 transitions. Word has length 190 [2022-07-21 05:03:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:11,659 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 173 transitions. [2022-07-21 05:03:11,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 9 states have call successors, (20), 2 states have call predecessors, (20), 9 states have return successors, (30), 13 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-21 05:03:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 173 transitions. [2022-07-21 05:03:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 05:03:11,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:11,660 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:11,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:11,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:11,878 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1294012555, now seen corresponding path program 6 times [2022-07-21 05:03:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107712649] [2022-07-21 05:03:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 05:03:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 158 proven. 354 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-07-21 05:03:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:12,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107712649] [2022-07-21 05:03:12,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107712649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:12,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146690000] [2022-07-21 05:03:12,074 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 05:03:12,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:12,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:12,092 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) [2022-07-21 05:03:12,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 05:03:12,258 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-21 05:03:12,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:12,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 05:03:12,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 595 proven. 114 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-07-21 05:03:12,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 160 proven. 360 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2022-07-21 05:03:13,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146690000] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:13,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:13,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2022-07-21 05:03:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46167730] [2022-07-21 05:03:13,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:13,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 05:03:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:13,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 05:03:13,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-07-21 05:03:13,498 INFO L87 Difference]: Start difference. First operand 105 states and 173 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2022-07-21 05:03:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:13,861 INFO L93 Difference]: Finished difference Result 201 states and 358 transitions. [2022-07-21 05:03:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 05:03:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 144 [2022-07-21 05:03:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:13,864 INFO L225 Difference]: With dead ends: 201 [2022-07-21 05:03:13,864 INFO L226 Difference]: Without dead ends: 105 [2022-07-21 05:03:13,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 320 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=433, Invalid=1459, Unknown=0, NotChecked=0, Total=1892 [2022-07-21 05:03:13,865 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:13,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 177 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:03:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-21 05:03:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-21 05:03:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 19 states have call successors, (19), 9 states have call predecessors, (19), 15 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) [2022-07-21 05:03:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions. [2022-07-21 05:03:13,899 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 144 [2022-07-21 05:03:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:13,900 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 165 transitions. [2022-07-21 05:03:13,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 20 states have internal predecessors, (69), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2022-07-21 05:03:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions. [2022-07-21 05:03:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-21 05:03:13,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:13,903 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:03:13,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:14,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:14,104 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 332854534, now seen corresponding path program 7 times [2022-07-21 05:03:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:14,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177769872] [2022-07-21 05:03:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:14,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 05:03:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:03:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2022-07-21 05:03:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:14,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177769872] [2022-07-21 05:03:14,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177769872] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:14,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297117598] [2022-07-21 05:03:14,644 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 05:03:14,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:14,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:14,645 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) [2022-07-21 05:03:14,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 05:03:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:14,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-21 05:03:14,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2022-07-21 05:03:15,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 597 proven. 189 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2022-07-21 05:03:16,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297117598] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:16,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:16,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 36 [2022-07-21 05:03:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762062143] [2022-07-21 05:03:16,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:16,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-21 05:03:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-21 05:03:16,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 05:03:16,215 INFO L87 Difference]: Start difference. First operand 105 states and 165 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) [2022-07-21 05:03:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:18,131 INFO L93 Difference]: Finished difference Result 247 states and 510 transitions. [2022-07-21 05:03:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-21 05:03:18,131 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 [2022-07-21 05:03:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:18,134 INFO L225 Difference]: With dead ends: 247 [2022-07-21 05:03:18,134 INFO L226 Difference]: Without dead ends: 243 [2022-07-21 05:03:18,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 404 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=610, Invalid=4792, Unknown=0, NotChecked=0, Total=5402 [2022-07-21 05:03:18,136 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 78 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:18,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 464 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 05:03:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-21 05:03:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 127. [2022-07-21 05:03:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 85 states have internal predecessors, (91), 21 states have call successors, (21), 9 states have call predecessors, (21), 21 states have return successors, (107), 32 states have call predecessors, (107), 21 states have call successors, (107) [2022-07-21 05:03:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 219 transitions. [2022-07-21 05:03:18,154 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 219 transitions. Word has length 183 [2022-07-21 05:03:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:18,154 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 219 transitions. [2022-07-21 05:03:18,154 INFO L496 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) [2022-07-21 05:03:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 219 transitions. [2022-07-21 05:03:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-21 05:03:18,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:18,155 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:03:18,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:18,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-21 05:03:18,375 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash -860565711, now seen corresponding path program 8 times [2022-07-21 05:03:18,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:18,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251748076] [2022-07-21 05:03:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 05:03:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 503 proven. 360 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2022-07-21 05:03:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:18,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251748076] [2022-07-21 05:03:18,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251748076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:18,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794202748] [2022-07-21 05:03:18,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 05:03:18,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:18,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:18,696 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) [2022-07-21 05:03:18,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 05:03:18,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 05:03:18,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:18,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-21 05:03:18,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2022-07-21 05:03:18,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2022-07-21 05:03:21,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794202748] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:21,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:21,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 34 [2022-07-21 05:03:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206328411] [2022-07-21 05:03:21,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:21,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 05:03:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:21,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 05:03:21,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 05:03:21,280 INFO L87 Difference]: Start difference. First operand 127 states and 219 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) [2022-07-21 05:03:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:21,804 INFO L93 Difference]: Finished difference Result 277 states and 584 transitions. [2022-07-21 05:03:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 05:03:21,804 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 [2022-07-21 05:03:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:21,808 INFO L225 Difference]: With dead ends: 277 [2022-07-21 05:03:21,808 INFO L226 Difference]: Without dead ends: 159 [2022-07-21 05:03:21,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 376 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=826, Invalid=3206, Unknown=0, NotChecked=0, Total=4032 [2022-07-21 05:03:21,811 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:21,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 253 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:03:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-21 05:03:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-07-21 05:03:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.0673076923076923) internal successors, (111), 105 states have internal predecessors, (111), 25 states have call successors, (25), 9 states have call predecessors, (25), 29 states have return successors, (150), 44 states have call predecessors, (150), 25 states have call successors, (150) [2022-07-21 05:03:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 286 transitions. [2022-07-21 05:03:21,824 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 286 transitions. Word has length 170 [2022-07-21 05:03:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:21,825 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 286 transitions. [2022-07-21 05:03:21,825 INFO L496 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) [2022-07-21 05:03:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 286 transitions. [2022-07-21 05:03:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-21 05:03:21,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:21,827 INFO L195 NwaCegarLoop]: 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] [2022-07-21 05:03:21,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:22,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 05:03:22,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:22,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash 530318069, now seen corresponding path program 9 times [2022-07-21 05:03:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:22,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819145654] [2022-07-21 05:03:22,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:22,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 05:03:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:03:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:03:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 665 proven. 517 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2022-07-21 05:03:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819145654] [2022-07-21 05:03:22,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819145654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419649966] [2022-07-21 05:03:22,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 05:03:22,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:22,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:22,416 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) [2022-07-21 05:03:22,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 05:03:22,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2022-07-21 05:03:22,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:22,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 05:03:22,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2022-07-21 05:03:22,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 685 proven. 580 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2022-07-21 05:03:26,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419649966] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:26,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:26,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 32] total 38 [2022-07-21 05:03:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690066756] [2022-07-21 05:03:26,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-21 05:03:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-21 05:03:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2022-07-21 05:03:26,112 INFO L87 Difference]: Start difference. First operand 159 states and 286 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) [2022-07-21 05:03:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:26,774 INFO L93 Difference]: Finished difference Result 331 states and 698 transitions. [2022-07-21 05:03:26,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 05:03:26,775 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 [2022-07-21 05:03:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:26,779 INFO L225 Difference]: With dead ends: 331 [2022-07-21 05:03:26,779 INFO L226 Difference]: Without dead ends: 181 [2022-07-21 05:03:26,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 434 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=759, Invalid=3147, Unknown=0, NotChecked=0, Total=3906 [2022-07-21 05:03:26,781 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 114 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:26,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 335 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 05:03:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-21 05:03:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2022-07-21 05:03:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.0654205607476634) internal successors, (114), 108 states have internal predecessors, (114), 26 states have call successors, (26), 9 states have call predecessors, (26), 30 states have return successors, (154), 46 states have call predecessors, (154), 26 states have call successors, (154) [2022-07-21 05:03:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 294 transitions. [2022-07-21 05:03:26,797 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 294 transitions. Word has length 196 [2022-07-21 05:03:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:26,799 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 294 transitions. [2022-07-21 05:03:26,799 INFO L496 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) [2022-07-21 05:03:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 294 transitions. [2022-07-21 05:03:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-07-21 05:03:26,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:26,801 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 24, 20, 19, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:26,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:27,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 05:03:27,041 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 462778554, now seen corresponding path program 10 times [2022-07-21 05:03:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:27,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713097291] [2022-07-21 05:03:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 05:03:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:03:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 05:03:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:03:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:03:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 05:03:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 233 proven. 548 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2022-07-21 05:03:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:27,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713097291] [2022-07-21 05:03:27,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713097291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:27,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707797873] [2022-07-21 05:03:27,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 05:03:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:27,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:27,408 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) [2022-07-21 05:03:27,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 05:03:27,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 05:03:27,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:27,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:03:27,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 239 proven. 542 refuted. 0 times theorem prover too weak. 3983 trivial. 0 not checked. [2022-07-21 05:03:27,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 239 proven. 557 refuted. 0 times theorem prover too weak. 3968 trivial. 0 not checked. [2022-07-21 05:03:28,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707797873] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:28,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:28,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2022-07-21 05:03:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092143622] [2022-07-21 05:03:28,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:28,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 05:03:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 05:03:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-21 05:03:28,373 INFO L87 Difference]: Start difference. First operand 164 states and 294 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) [2022-07-21 05:03:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:28,440 INFO L93 Difference]: Finished difference Result 168 states and 297 transitions. [2022-07-21 05:03:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 05:03:28,440 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 294 [2022-07-21 05:03:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:28,442 INFO L225 Difference]: With dead ends: 168 [2022-07-21 05:03:28,442 INFO L226 Difference]: Without dead ends: 164 [2022-07-21 05:03:28,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 669 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2022-07-21 05:03:28,443 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:28,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 114 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:03:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-21 05:03:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2022-07-21 05:03:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 100 states have internal predecessors, (106), 26 states have call successors, (26), 9 states have call predecessors, (26), 26 states have return successors, (118), 42 states have call predecessors, (118), 26 states have call successors, (118) [2022-07-21 05:03:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2022-07-21 05:03:28,469 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 294 [2022-07-21 05:03:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:28,470 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2022-07-21 05:03:28,470 INFO L496 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) [2022-07-21 05:03:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2022-07-21 05:03:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-21 05:03:28,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:03:28,472 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 23, 18, 17, 17, 17, 17, 17, 17, 17, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:03:28,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:28,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 05:03:28,673 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:03:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:03:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 582117116, now seen corresponding path program 11 times [2022-07-21 05:03:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:03:28,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757488404] [2022-07-21 05:03:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:03:28,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:03:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:03:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 05:03:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 05:03:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 05:03:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 05:03:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 05:03:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 05:03:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 05:03:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 05:03:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:03:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:03:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:03:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 238 proven. 956 refuted. 0 times theorem prover too weak. 2913 trivial. 0 not checked. [2022-07-21 05:03:29,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:03:29,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757488404] [2022-07-21 05:03:29,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757488404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:03:29,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224614482] [2022-07-21 05:03:29,242 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 05:03:29,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:03:29,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:03:29,272 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 05:03:29,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 05:03:29,563 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-21 05:03:29,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 05:03:29,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-21 05:03:29,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:03:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 2428 proven. 401 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2022-07-21 05:03:29,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:03:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 700 proven. 1204 refuted. 0 times theorem prover too weak. 2203 trivial. 0 not checked. [2022-07-21 05:03:33,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224614482] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:03:33,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:03:33,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 29] total 40 [2022-07-21 05:03:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713144768] [2022-07-21 05:03:33,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:03:33,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 05:03:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:03:33,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 05:03:33,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1398, Unknown=0, NotChecked=0, Total=1560 [2022-07-21 05:03:33,104 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand has 40 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 20 states have call successors, (27), 2 states have call predecessors, (27), 20 states have return successors, (47), 23 states have call predecessors, (47), 20 states have call successors, (47) [2022-07-21 05:03:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:03:34,184 INFO L93 Difference]: Finished difference Result 294 states and 558 transitions. [2022-07-21 05:03:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-07-21 05:03:34,184 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 20 states have call successors, (27), 2 states have call predecessors, (27), 20 states have return successors, (47), 23 states have call predecessors, (47), 20 states have call successors, (47) Word has length 275 [2022-07-21 05:03:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:03:34,185 INFO L225 Difference]: With dead ends: 294 [2022-07-21 05:03:34,185 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 05:03:34,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 601 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1969, Invalid=8333, Unknown=0, NotChecked=0, Total=10302 [2022-07-21 05:03:34,189 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 95 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 05:03:34,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 280 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 05:03:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 05:03:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 05:03:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 05:03:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 05:03:34,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2022-07-21 05:03:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:03:34,190 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 05:03:34,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 35 states have internal predecessors, (101), 20 states have call successors, (27), 2 states have call predecessors, (27), 20 states have return successors, (47), 23 states have call predecessors, (47), 20 states have call successors, (47) [2022-07-21 05:03:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 05:03:34,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 05:03:34,195 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:03:34,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 05:03:34,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 05:03:34,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 05:03:37,165 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 05:03:37,166 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 05:03:37,166 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 05:03:37,166 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2022-07-21 05:03:37,166 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 05:03:37,166 INFO L902 garLoopResultBuilder]: At program point L27(lines 27 47) the Hoare annotation is: true [2022-07-21 05:03:37,166 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2022-07-21 05:03:37,166 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-07-21 05:03:37,167 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-07-21 05:03:37,167 INFO L902 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: true [2022-07-21 05:03:37,167 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-07-21 05:03:37,167 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2022-07-21 05:03:37,167 INFO L899 garLoopResultBuilder]: For program point ackermannEXIT(lines 16 24) no Hoare annotation was computed. [2022-07-21 05:03:37,167 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (or (not (<= 1 |ackermann_#in~n|)) (not (= |ackermann_#in~m| 0)) (not (< |ackermann_#in~n| 2))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2022-07-21 05:03:37,167 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-07-21 05:03:37,167 INFO L902 garLoopResultBuilder]: At program point ackermannENTRY(lines 16 24) the Hoare annotation is: true [2022-07-21 05:03:37,168 INFO L895 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|)) [2022-07-21 05:03:37,168 INFO L895 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse3 (<= 1 |ackermann_#in~n|)) (.cse5 (<= |ackermann_#in~n| 1)) (.cse7 (<= |ackermann_#t~ret5| 5)) (.cse9 (<= 3 |ackermann_#in~n|)) (.cse2 (<= 3 |ackermann_#t~ret5|)) (.cse8 (<= 2 |ackermann_#in~n|)) (.cse4 (<= |ackermann_#t~ret5| 3)) (.cse6 (<= 5 |ackermann_#t~ret5|)) (.cse0 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (= ackermann_~m |ackermann_#in~m|))) (and (or (not (<= |ackermann_#in~m| 0)) (and (= |ackermann_#in~m| 0) .cse0 .cse1)) (or (and .cse2 .cse0 (<= ackermann_~m 2) .cse3 .cse1 .cse4 .cse5) (and (<= 3 ackermann_~m) .cse6 .cse0 .cse3 .cse1) (not (<= 2 |ackermann_#in~m|)) (and .cse6 .cse7 .cse0 .cse8 .cse1) (and .cse6 .cse0 .cse9 .cse1)) (or (and (<= 1 ackermann_~m) (<= |ackermann_#t~ret5| 2) .cse0 (<= 2 |ackermann_#t~ret5|) .cse3 (<= ackermann_~m 1) .cse5) (and .cse6 .cse7 .cse0 (<= 4 |ackermann_#in~n|) .cse1 (<= |ackermann_#in~n| 4)) (not (<= |ackermann_#in~m| 1)) (and (<= |ackermann_#in~n| 3) (<= |ackermann_#t~ret5| 4) .cse0 .cse9 .cse1 (<= 4 |ackermann_#t~ret5|)) (and (<= |ackermann_#in~n| 2) .cse2 .cse0 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse1 (<= 6 |ackermann_#in~n|)) (not (<= 1 |ackermann_#in~m|)) (and (<= 6 |ackermann_#t~ret5|) .cse0 (<= |ackermann_#t~ret5| 6) .cse1 (<= 5 |ackermann_#in~n|))))) [2022-07-21 05:03:37,168 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 22) no Hoare annotation was computed. [2022-07-21 05:03:37,168 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-07-21 05:03:37,168 INFO L899 garLoopResultBuilder]: For program point L23-3(line 23) no Hoare annotation was computed. [2022-07-21 05:03:37,168 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2022-07-21 05:03:37,168 INFO L899 garLoopResultBuilder]: For program point ackermannFINAL(lines 16 24) no Hoare annotation was computed. [2022-07-21 05:03:37,171 INFO L356 BasicCegarLoop]: Path program histogram: [11, 1, 1] [2022-07-21 05:03:37,172 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:03:37,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:03:37 BoogieIcfgContainer [2022-07-21 05:03:37,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:03:37,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:03:37,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:03:37,179 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:03:37,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:02:58" (3/4) ... [2022-07-21 05:03:37,181 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 05:03:37,186 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2022-07-21 05:03:37,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-21 05:03:37,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-21 05:03:37,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 05:03:37,190 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 05:03:37,218 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:03:37,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:03:37,219 INFO L158 Benchmark]: Toolchain (without parser) took 38923.96ms. Allocated memory was 69.2MB in the beginning and 408.9MB in the end (delta: 339.7MB). Free memory was 52.5MB in the beginning and 298.5MB in the end (delta: -246.0MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2022-07-21 05:03:37,219 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 69.2MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:03:37,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.91ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 52.5MB in the end (delta: -46.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 05:03:37,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.12ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 51.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:03:37,220 INFO L158 Benchmark]: Boogie Preprocessor took 28.21ms. Allocated memory is still 69.2MB. Free memory was 51.0MB in the beginning and 50.2MB in the end (delta: 819.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:03:37,220 INFO L158 Benchmark]: RCFGBuilder took 280.05ms. Allocated memory is still 69.2MB. Free memory was 49.9MB in the beginning and 40.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 05:03:37,220 INFO L158 Benchmark]: TraceAbstraction took 38322.68ms. Allocated memory was 69.2MB in the beginning and 408.9MB in the end (delta: 339.7MB). Free memory was 40.3MB in the beginning and 301.6MB in the end (delta: -261.4MB). Peak memory consumption was 247.7MB. Max. memory is 16.1GB. [2022-07-21 05:03:37,221 INFO L158 Benchmark]: Witness Printer took 39.27ms. Allocated memory is still 408.9MB. Free memory was 301.6MB in the beginning and 298.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 05:03:37,223 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.23ms. Allocated memory is still 69.2MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.91ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 52.5MB in the end (delta: -46.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.12ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 51.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.21ms. Allocated memory is still 69.2MB. Free memory was 51.0MB in the beginning and 50.2MB in the end (delta: 819.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 280.05ms. Allocated memory is still 69.2MB. Free memory was 49.9MB in the beginning and 40.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38322.68ms. Allocated memory was 69.2MB in the beginning and 408.9MB in the end (delta: 339.7MB). Free memory was 40.3MB in the beginning and 301.6MB in the end (delta: -261.4MB). Peak memory consumption was 247.7MB. Max. memory is 16.1GB. * Witness Printer took 39.27ms. Allocated memory is still 408.9MB. Free memory was 301.6MB in the beginning and 298.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: 38.3s, OverallIterations: 13, TraceHistogramMax: 44, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 744 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 688 mSDsluCounter, 2747 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2391 mSDsCounter, 1559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7353 IncrementalHoareTripleChecker+Invalid, 8912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1559 mSolverCounterUnsat, 356 mSDtfsCounter, 7353 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4864 GetRequests, 4271 SyntacticMatches, 43 SemanticMatches, 550 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7655 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=11, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 186 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 690 PreInvPairs, 1887 NumberOfFragments, 238 HoareAnnotationTreeSize, 690 FomulaSimplifications, 19535 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 24810 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 3856 NumberOfCodeBlocks, 3583 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 5741 ConstructedInterpolants, 0 QuantifiedInterpolants, 11028 SizeOfPredicates, 91 NumberOfNonLiveVariables, 5048 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 37 InterpolantComputations, 1 PerfectInterpolantSequences, 48867/60372 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! [2022-07-21 05:03:37,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE