./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/bitvector-regression/recHanoi03-1.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 6ccf0fb82c260d93e0a183861fdeec7e448b86af ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/bitvector-regression/recHanoi03-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 6ccf0fb82c260d93e0a183861fdeec7e448b86af ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:08:19,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:08:19,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:08:19,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:08:19,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:08:19,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:08:19,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:08:19,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:08:19,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:08:19,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:08:19,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:08:19,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:08:19,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:08:19,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:08:19,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:08:19,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:08:19,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:08:19,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:08:19,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:08:19,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:08:19,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:08:19,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:08:19,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:08:19,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:08:19,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:08:19,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:08:19,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:08:19,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:08:19,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:08:19,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:08:19,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:08:19,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:08:19,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:08:19,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:08:19,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:08:19,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:08:19,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:08:19,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:08:19,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:08:19,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:08:19,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:08:19,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:08:19,380 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:08:19,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:08:19,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:08:19,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:08:19,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:08:19,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:08:19,382 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:08:19,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:08:19,383 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:08:19,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:08:19,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:08:19,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:08:19,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:08:19,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:08:19,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:08:19,384 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:08:19,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:08:19,385 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:08:19,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:08:19,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:08:19,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:08:19,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:08:19,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:08:19,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:08:19,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:08:19,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:08:19,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:08:19,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:08:19,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:08:19,387 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:08:19,387 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 -> 6ccf0fb82c260d93e0a183861fdeec7e448b86af [2021-08-25 20:08:19,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:08:19,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:08:19,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:08:19,718 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:08:19,720 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:08:19,721 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2021-08-25 20:08:19,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68b55b92/4879c37d0d794b85b3307d8c61e35ae0/FLAG91705b878 [2021-08-25 20:08:20,231 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:08:20,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2021-08-25 20:08:20,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68b55b92/4879c37d0d794b85b3307d8c61e35ae0/FLAG91705b878 [2021-08-25 20:08:20,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68b55b92/4879c37d0d794b85b3307d8c61e35ae0 [2021-08-25 20:08:20,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:08:20,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:08:20,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:08:20,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:08:20,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:08:20,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3247915b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20, skipping insertion in model container [2021-08-25 20:08:20,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:08:20,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:08:20,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2021-08-25 20:08:20,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:08:20,450 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:08:20,472 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2021-08-25 20:08:20,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:08:20,489 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:08:20,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20 WrapperNode [2021-08-25 20:08:20,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:08:20,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:08:20,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:08:20,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:08:20,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:08:20,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:08:20,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:08:20,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:08:20,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:08:20,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:08:20,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:08:20,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:08:20,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (1/1) ... [2021-08-25 20:08:20,668 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:08:20,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:08:20,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:08:20,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:08:20,750 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2021-08-25 20:08:20,751 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2021-08-25 20:08:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:08:20,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:08:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:08:20,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:08:21,114 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:08:21,114 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-25 20:08:21,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:08:21 BoogieIcfgContainer [2021-08-25 20:08:21,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:08:21,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:08:21,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:08:21,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:08:21,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:08:20" (1/3) ... [2021-08-25 20:08:21,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf9c711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:08:21, skipping insertion in model container [2021-08-25 20:08:21,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:20" (2/3) ... [2021-08-25 20:08:21,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf9c711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:08:21, skipping insertion in model container [2021-08-25 20:08:21,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:08:21" (3/3) ... [2021-08-25 20:08:21,122 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2021-08-25 20:08:21,141 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:08:21,141 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:08:21,212 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:08:21,238 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:08:21,238 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:08:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-25 20:08:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-25 20:08:21,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:08:21,278 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:08:21,279 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:08:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:08:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2021-08-25 20:08:21,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:08:21,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478621430] [2021-08-25 20:08:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:08:21,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:08:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:08:21,431 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:08:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:08:21,490 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:08:21,492 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:08:21,494 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:08:21,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:08:21,501 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:08:21,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:08:21 BoogieIcfgContainer [2021-08-25 20:08:21,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:08:21,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:08:21,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:08:21,532 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:08:21,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:08:21" (3/4) ... [2021-08-25 20:08:21,535 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:08:21,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:08:21,538 INFO L168 Benchmark]: Toolchain (without parser) took 1275.66 ms. Allocated memory is still 54.5 MB. Free memory was 37.4 MB in the beginning and 33.6 MB in the end (delta: 3.8 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:08:21,538 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 44.0 MB. Free memory was 26.1 MB in the beginning and 26.1 MB in the end (delta: 43.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:08:21,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.80 ms. Allocated memory is still 54.5 MB. Free memory was 37.2 MB in the beginning and 39.1 MB in the end (delta: -1.9 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:08:21,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.76 ms. Allocated memory is still 54.5 MB. Free memory was 39.1 MB in the beginning and 37.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:08:21,540 INFO L168 Benchmark]: Boogie Preprocessor took 50.20 ms. Allocated memory is still 54.5 MB. Free memory was 37.7 MB in the beginning and 36.7 MB in the end (delta: 990.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:08:21,541 INFO L168 Benchmark]: RCFGBuilder took 455.34 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.3 MB in the end (delta: 387.6 kB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:08:21,542 INFO L168 Benchmark]: TraceAbstraction took 410.59 ms. Allocated memory is still 54.5 MB. Free memory was 35.8 MB in the beginning and 34.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 775.5 kB. Max. memory is 16.1 GB. [2021-08-25 20:08:21,546 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 54.5 MB. Free memory was 34.0 MB in the beginning and 33.6 MB in the end (delta: 415.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:08:21,550 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.10 ms. Allocated memory is still 44.0 MB. Free memory was 26.1 MB in the beginning and 26.1 MB in the end (delta: 43.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 254.80 ms. Allocated memory is still 54.5 MB. Free memory was 37.2 MB in the beginning and 39.1 MB in the end (delta: -1.9 MB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.76 ms. Allocated memory is still 54.5 MB. Free memory was 39.1 MB in the beginning and 37.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.20 ms. Allocated memory is still 54.5 MB. Free memory was 37.7 MB in the beginning and 36.7 MB in the end (delta: 990.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 455.34 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.3 MB in the end (delta: 387.6 kB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 410.59 ms. Allocated memory is still 54.5 MB. Free memory was 35.8 MB in the beginning and 34.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 775.5 kB. Max. memory is 16.1 GB. * Witness Printer took 3.88 ms. Allocated memory is still 54.5 MB. Free memory was 34.0 MB in the beginning and 33.6 MB in the end (delta: 415.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 36]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 33. Possible FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) [L31] CALL, EXPR hanoi(n) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L31] RET, EXPR hanoi(n) [L31] unsigned result = hanoi(n); [L33] COND FALSE !(result+1>0 && result+1 == 1< 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 -> 6ccf0fb82c260d93e0a183861fdeec7e448b86af [2021-08-25 20:08:24,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:08:24,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:08:24,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:08:24,770 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:08:24,771 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:08:24,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2021-08-25 20:08:24,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ebd8ed07/350b4f99399741beb401202dbef2198e/FLAGe0590887a [2021-08-25 20:08:25,409 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:08:25,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2021-08-25 20:08:25,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ebd8ed07/350b4f99399741beb401202dbef2198e/FLAGe0590887a [2021-08-25 20:08:25,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ebd8ed07/350b4f99399741beb401202dbef2198e [2021-08-25 20:08:25,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:08:25,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:08:25,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:08:25,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:08:25,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:08:25,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:08:25" (1/1) ... [2021-08-25 20:08:25,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4041501c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:25, skipping insertion in model container [2021-08-25 20:08:25,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:08:25" (1/1) ... [2021-08-25 20:08:25,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:08:25,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:08:26,129 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2021-08-25 20:08:26,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:08:26,143 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:08:26,160 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2021-08-25 20:08:26,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:08:26,172 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:08:26,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26 WrapperNode [2021-08-25 20:08:26,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:08:26,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:08:26,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:08:26,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:08:26,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:08:26,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:08:26,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:08:26,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:08:26,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:08:26,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:08:26,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:08:26,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:08:26,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (1/1) ... [2021-08-25 20:08:26,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:08:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:08:26,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:08:26,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:08:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2021-08-25 20:08:26,445 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2021-08-25 20:08:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:08:26,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:08:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:08:26,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:08:26,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:08:26,728 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-25 20:08:26,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:08:26 BoogieIcfgContainer [2021-08-25 20:08:26,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:08:26,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:08:26,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:08:26,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:08:26,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:08:25" (1/3) ... [2021-08-25 20:08:26,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343db175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:08:26, skipping insertion in model container [2021-08-25 20:08:26,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:08:26" (2/3) ... [2021-08-25 20:08:26,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343db175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:08:26, skipping insertion in model container [2021-08-25 20:08:26,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:08:26" (3/3) ... [2021-08-25 20:08:26,737 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2021-08-25 20:08:26,741 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:08:26,742 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:08:26,796 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:08:26,802 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:08:26,802 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:08:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-25 20:08:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-25 20:08:26,823 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:08:26,824 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:08:26,824 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:08:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:08:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2021-08-25 20:08:26,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:08:26,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914953022] [2021-08-25 20:08:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:08:26,844 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:08:26,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:08:26,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:08:26,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:08:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:08:26,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-25 20:08:26,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:08:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:08:27,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:08:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:08:27,698 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:08:27,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914953022] [2021-08-25 20:08:27,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914953022] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:08:27,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:08:27,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2021-08-25 20:08:27,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639025032] [2021-08-25 20:08:27,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 20:08:27,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:08:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 20:08:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:08:27,716 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-25 20:08:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:08:27,931 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-08-25 20:08:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 20:08:27,933 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 11 [2021-08-25 20:08:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:08:27,938 INFO L225 Difference]: With dead ends: 32 [2021-08-25 20:08:27,939 INFO L226 Difference]: Without dead ends: 16 [2021-08-25 20:08:27,941 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 270.9ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-25 20:08:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-08-25 20:08:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-08-25 20:08:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-25 20:08:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-08-25 20:08:27,967 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-08-25 20:08:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:08:27,967 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-08-25 20:08:27,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-25 20:08:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-08-25 20:08:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-25 20:08:27,969 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:08:27,969 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:08:27,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:08:28,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:08:28,179 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:08:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:08:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2021-08-25 20:08:28,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:08:28,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134979828] [2021-08-25 20:08:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:08:28,181 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:08:28,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:08:28,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:08:28,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:08:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:08:28,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-25 20:08:28,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:08:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-25 20:08:29,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:08:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 20:08:29,917 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:08:29,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134979828] [2021-08-25 20:08:29,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134979828] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:08:29,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:08:29,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-08-25 20:08:29,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054090735] [2021-08-25 20:08:29,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-25 20:08:29,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:08:29,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-25 20:08:29,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-08-25 20:08:29,922 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-25 20:08:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:08:30,246 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2021-08-25 20:08:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-25 20:08:30,247 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2021-08-25 20:08:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:08:30,252 INFO L225 Difference]: With dead ends: 28 [2021-08-25 20:08:30,252 INFO L226 Difference]: Without dead ends: 22 [2021-08-25 20:08:30,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 611.6ms TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2021-08-25 20:08:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-08-25 20:08:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-25 20:08:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-25 20:08:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-08-25 20:08:30,258 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2021-08-25 20:08:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:08:30,258 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-08-25 20:08:30,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-25 20:08:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2021-08-25 20:08:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-25 20:08:30,259 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:08:30,259 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:08:30,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:08:30,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:08:30,468 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:08:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:08:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2021-08-25 20:08:30,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:08:30,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648083856] [2021-08-25 20:08:30,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:08:30,470 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:08:30,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:08:30,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:08:30,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:08:30,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:08:30,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:08:30,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-25 20:08:30,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:08:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 20:08:31,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:08:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-08-25 20:08:33,662 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:08:33,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648083856] [2021-08-25 20:08:33,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648083856] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:08:33,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:08:33,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2021-08-25 20:08:33,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290733019] [2021-08-25 20:08:33,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-25 20:08:33,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:08:33,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-25 20:08:33,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2021-08-25 20:08:33,667 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-25 20:08:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:08:34,314 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2021-08-25 20:08:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-25 20:08:34,315 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 29 [2021-08-25 20:08:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:08:34,316 INFO L225 Difference]: With dead ends: 34 [2021-08-25 20:08:34,316 INFO L226 Difference]: Without dead ends: 28 [2021-08-25 20:08:34,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1434.8ms TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2021-08-25 20:08:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-08-25 20:08:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-25 20:08:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-25 20:08:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-08-25 20:08:34,322 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2021-08-25 20:08:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:08:34,322 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-08-25 20:08:34,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-08-25 20:08:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-08-25 20:08:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:08:34,323 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:08:34,324 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:08:34,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:08:34,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:08:34,525 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:08:34,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:08:34,525 INFO L82 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2021-08-25 20:08:34,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:08:34,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052389112] [2021-08-25 20:08:34,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 20:08:34,526 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:08:34,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:08:34,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:08:34,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:08:34,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-08-25 20:08:34,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:08:34,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-25 20:08:34,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:08:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-08-25 20:08:35,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:08:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 20:08:39,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:08:39,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052389112] [2021-08-25 20:08:39,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052389112] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:08:39,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:08:39,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2021-08-25 20:08:39,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826994515] [2021-08-25 20:08:39,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-25 20:08:39,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:08:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-25 20:08:39,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2021-08-25 20:08:39,531 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2021-08-25 20:08:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:08:40,845 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2021-08-25 20:08:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-25 20:08:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 41 [2021-08-25 20:08:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:08:40,847 INFO L225 Difference]: With dead ends: 40 [2021-08-25 20:08:40,847 INFO L226 Difference]: Without dead ends: 34 [2021-08-25 20:08:40,848 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2449.5ms TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2021-08-25 20:08:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-08-25 20:08:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-08-25 20:08:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-25 20:08:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-08-25 20:08:40,858 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2021-08-25 20:08:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:08:40,859 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-08-25 20:08:40,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2021-08-25 20:08:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-08-25 20:08:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-25 20:08:40,863 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:08:40,863 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:08:40,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-08-25 20:08:41,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:08:41,073 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:08:41,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:08:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2021-08-25 20:08:41,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:08:41,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782695139] [2021-08-25 20:08:41,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 20:08:41,082 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:08:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:08:41,097 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:08:41,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 20:08:41,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 20:08:41,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:08:41,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-25 20:08:41,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:08:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-08-25 20:08:42,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:08:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-25 20:08:48,056 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:08:48,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782695139] [2021-08-25 20:08:48,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782695139] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:08:48,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:08:48,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2021-08-25 20:08:48,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192707884] [2021-08-25 20:08:48,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-08-25 20:08:48,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:08:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-08-25 20:08:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2021-08-25 20:08:48,059 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2021-08-25 20:08:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:08:49,865 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2021-08-25 20:08:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-25 20:08:49,870 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) Word has length 53 [2021-08-25 20:08:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:08:49,871 INFO L225 Difference]: With dead ends: 46 [2021-08-25 20:08:49,871 INFO L226 Difference]: Without dead ends: 40 [2021-08-25 20:08:49,872 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 3483.7ms TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2021-08-25 20:08:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-25 20:08:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-25 20:08:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-25 20:08:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-08-25 20:08:49,885 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2021-08-25 20:08:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:08:49,887 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-08-25 20:08:49,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2021-08-25 20:08:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-08-25 20:08:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-25 20:08:49,892 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:08:49,892 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:08:49,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:08:50,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:08:50,102 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:08:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:08:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2021-08-25 20:08:50,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:08:50,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617606103] [2021-08-25 20:08:50,103 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-25 20:08:50,104 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:08:50,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:08:50,106 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:08:50,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 20:08:50,437 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-08-25 20:08:50,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:08:50,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-25 20:08:50,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:08:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-08-25 20:08:51,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:08:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-08-25 20:08:58,888 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:08:58,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617606103] [2021-08-25 20:08:58,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617606103] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:08:58,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:08:58,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2021-08-25 20:08:58,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141573129] [2021-08-25 20:08:58,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-08-25 20:08:58,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:08:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-08-25 20:08:58,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2021-08-25 20:08:58,894 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2021-08-25 20:09:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:00,970 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2021-08-25 20:09:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-08-25 20:09:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) Word has length 65 [2021-08-25 20:09:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:00,972 INFO L225 Difference]: With dead ends: 52 [2021-08-25 20:09:00,972 INFO L226 Difference]: Without dead ends: 46 [2021-08-25 20:09:00,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 4900.4ms TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2021-08-25 20:09:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-25 20:09:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-08-25 20:09:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2021-08-25 20:09:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2021-08-25 20:09:00,979 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2021-08-25 20:09:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:00,980 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2021-08-25 20:09:00,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2021-08-25 20:09:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2021-08-25 20:09:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-25 20:09:00,981 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:00,981 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:00,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-08-25 20:09:01,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:09:01,185 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2021-08-25 20:09:01,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:09:01,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673941681] [2021-08-25 20:09:01,187 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-25 20:09:01,187 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:09:01,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:09:01,188 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:09:01,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 20:09:01,701 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2021-08-25 20:09:01,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:09:01,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-25 20:09:01,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-08-25 20:09:02,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:09:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-25 20:09:12,582 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:09:12,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673941681] [2021-08-25 20:09:12,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673941681] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:09:12,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:12,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2021-08-25 20:09:12,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085559119] [2021-08-25 20:09:12,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-08-25 20:09:12,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:09:12,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-08-25 20:09:12,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2021-08-25 20:09:12,586 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2021-08-25 20:09:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:15,740 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2021-08-25 20:09:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-25 20:09:15,741 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) Word has length 77 [2021-08-25 20:09:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:15,742 INFO L225 Difference]: With dead ends: 58 [2021-08-25 20:09:15,742 INFO L226 Difference]: Without dead ends: 52 [2021-08-25 20:09:15,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 6758.7ms TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2021-08-25 20:09:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-08-25 20:09:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-08-25 20:09:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2021-08-25 20:09:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-08-25 20:09:15,755 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2021-08-25 20:09:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:15,756 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-08-25 20:09:15,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2021-08-25 20:09:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-08-25 20:09:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:09:15,761 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:15,761 INFO L512 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:15,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 20:09:15,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:09:15,972 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:15,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2021-08-25 20:09:15,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:09:15,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271477793] [2021-08-25 20:09:15,973 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-25 20:09:15,973 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:09:15,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:09:15,997 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:09:16,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 20:09:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:09:16,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 60 conjunts are in the unsatisfiable core [2021-08-25 20:09:16,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-08-25 20:09:17,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:09:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-08-25 20:09:28,821 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:09:28,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271477793] [2021-08-25 20:09:28,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271477793] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:09:28,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:28,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2021-08-25 20:09:28,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448509041] [2021-08-25 20:09:28,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2021-08-25 20:09:28,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:09:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-08-25 20:09:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2021-08-25 20:09:28,825 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2021-08-25 20:09:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:31,690 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2021-08-25 20:09:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-25 20:09:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) Word has length 89 [2021-08-25 20:09:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:31,692 INFO L225 Difference]: With dead ends: 64 [2021-08-25 20:09:31,692 INFO L226 Difference]: Without dead ends: 58 [2021-08-25 20:09:31,694 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 7261.2ms TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2021-08-25 20:09:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-08-25 20:09:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-08-25 20:09:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2021-08-25 20:09:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2021-08-25 20:09:31,701 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2021-08-25 20:09:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:31,701 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2021-08-25 20:09:31,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2021-08-25 20:09:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2021-08-25 20:09:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:09:31,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:31,703 INFO L512 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:31,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-25 20:09:31,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:09:31,917 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:31,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2021-08-25 20:09:31,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:09:31,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131943999] [2021-08-25 20:09:31,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:09:31,918 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:09:31,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:09:31,919 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:09:31,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-25 20:09:32,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:09:32,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:09:32,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 68 conjunts are in the unsatisfiable core [2021-08-25 20:09:32,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-08-25 20:09:33,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:09:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-08-25 20:09:46,820 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:09:46,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131943999] [2021-08-25 20:09:46,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131943999] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:09:46,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:09:46,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2021-08-25 20:09:46,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910699287] [2021-08-25 20:09:46,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2021-08-25 20:09:46,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:09:46,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-08-25 20:09:46,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2021-08-25 20:09:46,824 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2021-08-25 20:09:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:09:50,660 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2021-08-25 20:09:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-25 20:09:50,661 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) Word has length 101 [2021-08-25 20:09:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:09:50,662 INFO L225 Difference]: With dead ends: 70 [2021-08-25 20:09:50,662 INFO L226 Difference]: Without dead ends: 64 [2021-08-25 20:09:50,665 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 8918.3ms TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2021-08-25 20:09:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-25 20:09:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-08-25 20:09:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2021-08-25 20:09:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-08-25 20:09:50,671 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2021-08-25 20:09:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:09:50,672 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-08-25 20:09:50,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2021-08-25 20:09:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-08-25 20:09:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-08-25 20:09:50,673 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:09:50,673 INFO L512 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:09:50,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-25 20:09:50,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:09:50,876 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:09:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:09:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2021-08-25 20:09:50,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:09:50,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800447970] [2021-08-25 20:09:50,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 20:09:50,877 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:09:50,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:09:50,879 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:09:50,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-25 20:09:51,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2021-08-25 20:09:51,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:09:51,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 76 conjunts are in the unsatisfiable core [2021-08-25 20:09:51,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:09:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-08-25 20:09:53,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:10:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-08-25 20:10:10,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:10:10,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800447970] [2021-08-25 20:10:10,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800447970] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:10:10,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:10:10,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2021-08-25 20:10:10,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544667127] [2021-08-25 20:10:10,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2021-08-25 20:10:10,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:10:10,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-08-25 20:10:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2021-08-25 20:10:10,778 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2021-08-25 20:10:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:16,671 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2021-08-25 20:10:16,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-25 20:10:16,672 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) Word has length 113 [2021-08-25 20:10:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:16,673 INFO L225 Difference]: With dead ends: 76 [2021-08-25 20:10:16,673 INFO L226 Difference]: Without dead ends: 70 [2021-08-25 20:10:16,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 12630.7ms TimeCoverageRelationStatistics Valid=1274, Invalid=16816, Unknown=0, NotChecked=0, Total=18090 [2021-08-25 20:10:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-25 20:10:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-25 20:10:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2021-08-25 20:10:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-08-25 20:10:16,695 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 113 [2021-08-25 20:10:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:16,696 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-08-25 20:10:16,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2021-08-25 20:10:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-08-25 20:10:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-08-25 20:10:16,698 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:16,698 INFO L512 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:10:16,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-25 20:10:16,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:10:16,899 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:10:16,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:16,899 INFO L82 PathProgramCache]: Analyzing trace with hash 685850484, now seen corresponding path program 10 times [2021-08-25 20:10:16,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:10:16,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433442885] [2021-08-25 20:10:16,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 20:10:16,900 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:10:16,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:10:16,914 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:10:16,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-25 20:10:18,134 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 20:10:18,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:10:18,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 84 conjunts are in the unsatisfiable core [2021-08-25 20:10:18,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:10:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-08-25 20:10:20,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:10:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-08-25 20:10:44,362 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:10:44,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433442885] [2021-08-25 20:10:44,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433442885] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:10:44,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:10:44,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2021-08-25 20:10:44,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650126032] [2021-08-25 20:10:44,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2021-08-25 20:10:44,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:10:44,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2021-08-25 20:10:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2021-08-25 20:10:44,365 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2021-08-25 20:10:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:49,935 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2021-08-25 20:10:49,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-25 20:10:49,936 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) Word has length 125 [2021-08-25 20:10:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:49,937 INFO L225 Difference]: With dead ends: 82 [2021-08-25 20:10:49,937 INFO L226 Difference]: Without dead ends: 76 [2021-08-25 20:10:49,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 15824.8ms TimeCoverageRelationStatistics Valid=1494, Invalid=20558, Unknown=0, NotChecked=0, Total=22052 [2021-08-25 20:10:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-08-25 20:10:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-08-25 20:10:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2021-08-25 20:10:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-08-25 20:10:49,945 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 125 [2021-08-25 20:10:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:49,946 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-08-25 20:10:49,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2021-08-25 20:10:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-08-25 20:10:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-25 20:10:49,947 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:49,947 INFO L512 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:10:49,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-25 20:10:50,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:10:50,160 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:10:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 11 times [2021-08-25 20:10:50,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:10:50,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585144823] [2021-08-25 20:10:50,162 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-25 20:10:50,162 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:10:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:10:50,166 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:10:50,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-25 20:10:51,591 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2021-08-25 20:10:51,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:10:51,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 92 conjunts are in the unsatisfiable core [2021-08-25 20:10:51,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:10:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-08-25 20:10:53,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:11:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-08-25 20:11:18,877 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:11:18,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585144823] [2021-08-25 20:11:18,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585144823] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:11:18,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:11:18,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2021-08-25 20:11:18,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837129375] [2021-08-25 20:11:18,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2021-08-25 20:11:18,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:11:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2021-08-25 20:11:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2021-08-25 20:11:18,880 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2021-08-25 20:11:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:25,776 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2021-08-25 20:11:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-08-25 20:11:25,776 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) Word has length 137 [2021-08-25 20:11:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:25,777 INFO L225 Difference]: With dead ends: 88 [2021-08-25 20:11:25,777 INFO L226 Difference]: Without dead ends: 82 [2021-08-25 20:11:25,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 17492.6ms TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2021-08-25 20:11:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-08-25 20:11:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-08-25 20:11:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2021-08-25 20:11:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2021-08-25 20:11:25,785 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2021-08-25 20:11:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:25,785 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2021-08-25 20:11:25,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2021-08-25 20:11:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2021-08-25 20:11:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-08-25 20:11:25,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:25,787 INFO L512 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:25,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-08-25 20:11:25,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:11:26,000 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:11:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 12 times [2021-08-25 20:11:26,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:11:26,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841354935] [2021-08-25 20:11:26,001 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-25 20:11:26,005 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:11:26,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:11:26,006 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:11:26,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-25 20:11:27,844 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2021-08-25 20:11:27,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:11:27,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 100 conjunts are in the unsatisfiable core [2021-08-25 20:11:27,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:11:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2021-08-25 20:11:30,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:12:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-08-25 20:12:00,258 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:12:00,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841354935] [2021-08-25 20:12:00,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841354935] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:12:00,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:12:00,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2021-08-25 20:12:00,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082743742] [2021-08-25 20:12:00,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2021-08-25 20:12:00,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:12:00,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2021-08-25 20:12:00,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2021-08-25 20:12:00,261 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) [2021-08-25 20:12:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:12:08,908 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2021-08-25 20:12:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-08-25 20:12:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) Word has length 149 [2021-08-25 20:12:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:12:08,910 INFO L225 Difference]: With dead ends: 94 [2021-08-25 20:12:08,910 INFO L226 Difference]: Without dead ends: 88 [2021-08-25 20:12:08,911 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 21074.9ms TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2021-08-25 20:12:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-08-25 20:12:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-08-25 20:12:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2021-08-25 20:12:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2021-08-25 20:12:08,917 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 149 [2021-08-25 20:12:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:12:08,918 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2021-08-25 20:12:08,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) [2021-08-25 20:12:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2021-08-25 20:12:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-25 20:12:08,919 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:12:08,920 INFO L512 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:12:08,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-25 20:12:09,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:12:09,133 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:12:09,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:12:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1677247156, now seen corresponding path program 13 times [2021-08-25 20:12:09,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:12:09,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354539333] [2021-08-25 20:12:09,134 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-25 20:12:09,134 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:12:09,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:12:09,135 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:12:09,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-25 20:12:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:12:10,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 108 conjunts are in the unsatisfiable core [2021-08-25 20:12:10,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:12:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2021-08-25 20:12:13,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:12:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2021-08-25 20:12:49,878 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:12:49,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354539333] [2021-08-25 20:12:49,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354539333] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:12:49,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:12:49,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2021-08-25 20:12:49,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937880097] [2021-08-25 20:12:49,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2021-08-25 20:12:49,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:12:49,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2021-08-25 20:12:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2021-08-25 20:12:49,881 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) [2021-08-25 20:13:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:00,107 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2021-08-25 20:13:00,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-08-25 20:13:00,108 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) Word has length 161 [2021-08-25 20:13:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:00,109 INFO L225 Difference]: With dead ends: 100 [2021-08-25 20:13:00,109 INFO L226 Difference]: Without dead ends: 94 [2021-08-25 20:13:00,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 26115.1ms TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2021-08-25 20:13:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-25 20:13:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-08-25 20:13:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 64 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 28 states have return successors, (29), 28 states have call predecessors, (29), 2 states have call successors, (29) [2021-08-25 20:13:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-08-25 20:13:00,121 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 161 [2021-08-25 20:13:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:00,121 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-08-25 20:13:00,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) [2021-08-25 20:13:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-08-25 20:13:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-08-25 20:13:00,123 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:00,123 INFO L512 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:00,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-08-25 20:13:00,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:13:00,358 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1199460748, now seen corresponding path program 14 times [2021-08-25 20:13:00,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:13:00,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283852020] [2021-08-25 20:13:00,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:13:00,360 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:13:00,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:13:00,367 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:13:00,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-25 20:13:02,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:13:02,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:13:02,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 116 conjunts are in the unsatisfiable core [2021-08-25 20:13:02,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2021-08-25 20:13:05,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:13:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2021-08-25 20:13:48,567 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:13:48,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283852020] [2021-08-25 20:13:48,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283852020] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:13:48,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:48,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2021-08-25 20:13:48,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889484050] [2021-08-25 20:13:48,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2021-08-25 20:13:48,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:13:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2021-08-25 20:13:48,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2021-08-25 20:13:48,570 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) [2021-08-25 20:13:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:58,242 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2021-08-25 20:13:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-08-25 20:13:58,243 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) Word has length 173 [2021-08-25 20:13:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:58,244 INFO L225 Difference]: With dead ends: 106 [2021-08-25 20:13:58,244 INFO L226 Difference]: Without dead ends: 100 [2021-08-25 20:13:58,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 29715.0ms TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2021-08-25 20:13:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-25 20:13:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-08-25 20:13:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 68 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 30 states have return successors, (31), 30 states have call predecessors, (31), 2 states have call successors, (31) [2021-08-25 20:13:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2021-08-25 20:13:58,271 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 173 [2021-08-25 20:13:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:58,272 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2021-08-25 20:13:58,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) [2021-08-25 20:13:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2021-08-25 20:13:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-08-25 20:13:58,274 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:58,274 INFO L512 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:58,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-25 20:13:58,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:13:58,489 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:58,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1668253132, now seen corresponding path program 15 times [2021-08-25 20:13:58,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:13:58,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267827374] [2021-08-25 20:13:58,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 20:13:58,490 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:13:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:13:58,492 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:13:58,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-25 20:14:01,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2021-08-25 20:14:01,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:14:01,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 124 conjunts are in the unsatisfiable core [2021-08-25 20:14:01,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:14:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2021-08-25 20:14:05,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:14:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-08-25 20:14:51,860 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:14:51,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267827374] [2021-08-25 20:14:51,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267827374] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 20:14:51,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:14:51,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2021-08-25 20:14:51,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906806362] [2021-08-25 20:14:51,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2021-08-25 20:14:51,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:14:51,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2021-08-25 20:14:51,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2021-08-25 20:14:51,863 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) [2021-08-25 20:15:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:15:03,900 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2021-08-25 20:15:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-08-25 20:15:03,902 INFO L78 Accepts]: Start accepts. Automaton has has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) Word has length 185 [2021-08-25 20:15:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:15:03,903 INFO L225 Difference]: With dead ends: 112 [2021-08-25 20:15:03,903 INFO L226 Difference]: Without dead ends: 106 [2021-08-25 20:15:03,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 32339.5ms TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2021-08-25 20:15:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-08-25 20:15:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-08-25 20:15:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 72 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (33), 32 states have call predecessors, (33), 2 states have call successors, (33) [2021-08-25 20:15:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2021-08-25 20:15:03,928 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 185 [2021-08-25 20:15:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:15:03,930 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2021-08-25 20:15:03,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) [2021-08-25 20:15:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2021-08-25 20:15:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-08-25 20:15:03,937 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:15:03,937 INFO L512 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:15:03,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-25 20:15:04,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:15:04,153 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:15:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:15:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash 422913524, now seen corresponding path program 16 times [2021-08-25 20:15:04,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:15:04,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573198394] [2021-08-25 20:15:04,154 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 20:15:04,154 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:15:04,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:15:04,156 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:15:04,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-25 20:15:07,417 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 20:15:07,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-08-25 20:15:07,418 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:15:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:15:07,793 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:15:07,794 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:15:07,794 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:15:07,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-25 20:15:08,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:15:08,018 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:15:08,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:15:08 BoogieIcfgContainer [2021-08-25 20:15:08,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:15:08,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:15:08,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:15:08,194 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:15:08,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:08:26" (3/4) ... [2021-08-25 20:15:08,196 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:15:08,275 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:15:08,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:15:08,277 INFO L168 Benchmark]: Toolchain (without parser) took 402444.92 ms. Allocated memory was 54.5 MB in the beginning and 906.0 MB in the end (delta: 851.4 MB). Free memory was 32.2 MB in the beginning and 472.5 MB in the end (delta: -440.3 MB). Peak memory consumption was 410.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:15:08,277 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.8 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:15:08,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.24 ms. Allocated memory is still 54.5 MB. Free memory was 32.1 MB in the beginning and 35.9 MB in the end (delta: -3.8 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:15:08,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.86 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 50.8 MB in the end (delta: -14.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:15:08,279 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 ms. Allocated memory is still 67.1 MB. Free memory was 50.8 MB in the beginning and 49.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:15:08,279 INFO L168 Benchmark]: RCFGBuilder took 432.63 ms. Allocated memory is still 67.1 MB. Free memory was 49.7 MB in the beginning and 37.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:15:08,279 INFO L168 Benchmark]: TraceAbstraction took 401460.59 ms. Allocated memory was 67.1 MB in the beginning and 906.0 MB in the end (delta: 838.9 MB). Free memory was 37.2 MB in the beginning and 480.9 MB in the end (delta: -443.7 MB). Peak memory consumption was 396.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:15:08,280 INFO L168 Benchmark]: Witness Printer took 81.97 ms. Allocated memory is still 906.0 MB. Free memory was 480.9 MB in the beginning and 472.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:15:08,281 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.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.8 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 337.24 ms. Allocated memory is still 54.5 MB. Free memory was 32.1 MB in the beginning and 35.9 MB in the end (delta: -3.8 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.86 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 50.8 MB in the end (delta: -14.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.71 ms. Allocated memory is still 67.1 MB. Free memory was 50.8 MB in the beginning and 49.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 432.63 ms. Allocated memory is still 67.1 MB. Free memory was 49.7 MB in the beginning and 37.6 MB in the end (delta: 12.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 401460.59 ms. Allocated memory was 67.1 MB in the beginning and 906.0 MB in the end (delta: 838.9 MB). Free memory was 37.2 MB in the beginning and 480.9 MB in the end (delta: -443.7 MB). Peak memory consumption was 396.6 MB. Max. memory is 16.1 GB. * Witness Printer took 81.97 ms. Allocated memory is still 906.0 MB. Free memory was 480.9 MB in the beginning and 472.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 36]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) [L31] CALL, EXPR hanoi(n) VAL [\old(n)=32] [L19] COND FALSE !(n == 1) VAL [\old(n)=32, n=32] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=31] [L19] COND FALSE !(n == 1) VAL [\old(n)=31, n=31] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=30] [L19] COND FALSE !(n == 1) VAL [\old(n)=30, n=30] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=29] [L19] COND FALSE !(n == 1) VAL [\old(n)=29, n=29] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=28] [L19] COND FALSE !(n == 1) VAL [\old(n)=28, n=28] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=27] [L19] COND FALSE !(n == 1) VAL [\old(n)=27, n=27] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=26] [L19] COND FALSE !(n == 1) VAL [\old(n)=26, n=26] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=25] [L19] COND FALSE !(n == 1) VAL [\old(n)=25, n=25] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=24] [L19] COND FALSE !(n == 1) VAL [\old(n)=24, n=24] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=23] [L19] COND FALSE !(n == 1) VAL [\old(n)=23, n=23] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=22] [L19] COND FALSE !(n == 1) VAL [\old(n)=22, n=22] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=21] [L19] COND FALSE !(n == 1) VAL [\old(n)=21, n=21] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=20] [L19] COND FALSE !(n == 1) VAL [\old(n)=20, n=20] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=19] [L19] COND FALSE !(n == 1) VAL [\old(n)=19, n=19] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=18] [L19] COND FALSE !(n == 1) VAL [\old(n)=18, n=18] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=17] [L19] COND FALSE !(n == 1) VAL [\old(n)=17, n=17] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=16] [L19] COND FALSE !(n == 1) VAL [\old(n)=16, n=16] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=15] [L19] COND FALSE !(n == 1) VAL [\old(n)=15, n=15] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=14] [L19] COND FALSE !(n == 1) VAL [\old(n)=14, n=14] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=13] [L19] COND FALSE !(n == 1) VAL [\old(n)=13, n=13] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=12] [L19] COND FALSE !(n == 1) VAL [\old(n)=12, n=12] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=11] [L19] COND FALSE !(n == 1) VAL [\old(n)=11, n=11] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=10] [L19] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=9] [L19] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=2, hanoi(n-1)=1, n=2] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=3, hanoi(n-1)=3, n=3] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=4, hanoi(n-1)=7, n=4] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=5, hanoi(n-1)=15, n=5] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=6, hanoi(n-1)=31, n=6] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=7, hanoi(n-1)=63, n=7] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=8, hanoi(n-1)=127, n=8] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=9, hanoi(n-1)=255, n=9] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=10, hanoi(n-1)=511, n=10] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=11, hanoi(n-1)=1023, n=11] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=12, hanoi(n-1)=2047, n=12] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=13, hanoi(n-1)=4095, n=13] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=14, hanoi(n-1)=8191, n=14] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=15, hanoi(n-1)=16383, n=15] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=16, hanoi(n-1)=32767, n=16] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=17, hanoi(n-1)=65535, n=17] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=18, hanoi(n-1)=131071, n=18] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=19, hanoi(n-1)=262143, n=19] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=20, hanoi(n-1)=524287, n=20] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=21, hanoi(n-1)=1048575, n=21] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=22, hanoi(n-1)=2097151, n=22] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=23, hanoi(n-1)=4194303, n=23] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=24, hanoi(n-1)=8388607, n=24] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=25, hanoi(n-1)=16777215, n=25] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=26, hanoi(n-1)=33554431, n=26] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=27, hanoi(n-1)=67108863, n=27] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=28, hanoi(n-1)=134217727, n=28] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=29, hanoi(n-1)=268435455, n=29] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=30, hanoi(n-1)=536870911, n=30] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=31, hanoi(n-1)=1073741823, n=31] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=32, hanoi(n-1)=2147483647, n=32] [L22] return 2 * (hanoi(n-1)) + 1; [L31] RET, EXPR hanoi(n) [L31] unsigned result = hanoi(n); [L33] COND FALSE !(result+1>0 && result+1 == 1<