./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9448a6696b4991e038dda55623feb6ffc9366da0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:29:46,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:29:46,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:29:46,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:29:46,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:29:46,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:29:46,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:29:46,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:29:46,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:29:46,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:29:46,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:29:46,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:29:46,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:29:46,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:29:46,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:29:46,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:29:46,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:29:46,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:29:46,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:29:46,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:29:46,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:29:46,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:29:46,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:29:46,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:29:46,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:29:46,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:29:46,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:29:46,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:29:46,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:29:46,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:29:46,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:29:46,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:29:46,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:29:46,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:29:46,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:29:46,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:29:46,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:29:46,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:29:46,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:29:46,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:29:46,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:29:46,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:29:46,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:29:46,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:29:46,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:29:46,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:29:46,219 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:29:46,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:29:46,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:29:46,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:29:46,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:29:46,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:29:46,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:29:46,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:29:46,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:29:46,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:29:46,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:29:46,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:29:46,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:29:46,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:29:46,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:29:46,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:29:46,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:29:46,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:29:46,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:29:46,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:29:46,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:29:46,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:29:46,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:29:46,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:29:46,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:29:46,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 9448a6696b4991e038dda55623feb6ffc9366da0 [2019-11-28 17:29:46,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:29:46,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:29:46,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:29:46,542 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:29:46,543 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:29:46,544 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2019-11-28 17:29:46,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d67a716/4509d33b298142ffa3d0a63993832cec/FLAGc5b2b507b [2019-11-28 17:29:47,069 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:29:47,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2019-11-28 17:29:47,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d67a716/4509d33b298142ffa3d0a63993832cec/FLAGc5b2b507b [2019-11-28 17:29:47,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d67a716/4509d33b298142ffa3d0a63993832cec [2019-11-28 17:29:47,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:29:47,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:29:47,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:47,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:29:47,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:29:47,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760d99d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47, skipping insertion in model container [2019-11-28 17:29:47,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:29:47,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:29:47,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:47,717 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:29:47,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:47,755 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:29:47,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47 WrapperNode [2019-11-28 17:29:47,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:47,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:47,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:29:47,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:29:47,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:47,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:29:47,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:29:47,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:29:47,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... [2019-11-28 17:29:47,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:29:47,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:29:47,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:29:47,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:29:47,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:29:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2019-11-28 17:29:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2019-11-28 17:29:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:29:47,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:29:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-28 17:29:47,935 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-28 17:29:48,107 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:29:48,108 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:29:48,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:48 BoogieIcfgContainer [2019-11-28 17:29:48,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:29:48,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:29:48,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:29:48,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:29:48,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:29:47" (1/3) ... [2019-11-28 17:29:48,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650b0ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:48, skipping insertion in model container [2019-11-28 17:29:48,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:47" (2/3) ... [2019-11-28 17:29:48,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650b0ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:48, skipping insertion in model container [2019-11-28 17:29:48,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:48" (3/3) ... [2019-11-28 17:29:48,119 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2019-11-28 17:29:48,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:29:48,135 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:29:48,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:29:48,175 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:29:48,175 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:29:48,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:29:48,176 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:29:48,176 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:29:48,176 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:29:48,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:29:48,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:29:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-11-28 17:29:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:29:48,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:48,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:48,202 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2105267373, now seen corresponding path program 1 times [2019-11-28 17:29:48,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:48,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922091825] [2019-11-28 17:29:48,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:29:48,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922091825] [2019-11-28 17:29:48,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:48,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:29:48,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171802807] [2019-11-28 17:29:48,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:29:48,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:29:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:29:48,464 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-11-28 17:29:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:48,563 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-11-28 17:29:48,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:48,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 17:29:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:48,574 INFO L225 Difference]: With dead ends: 30 [2019-11-28 17:29:48,574 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 17:29:48,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:29:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 17:29:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 17:29:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 17:29:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-28 17:29:48,619 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2019-11-28 17:29:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:48,619 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-28 17:29:48,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:29:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-11-28 17:29:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:29:48,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:48,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:48,622 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash -131148366, now seen corresponding path program 1 times [2019-11-28 17:29:48,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:48,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584247846] [2019-11-28 17:29:48,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:29:48,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584247846] [2019-11-28 17:29:48,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:48,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:29:48,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181761071] [2019-11-28 17:29:48,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:29:48,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:48,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:29:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:48,770 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 7 states. [2019-11-28 17:29:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:48,855 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-28 17:29:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:29:48,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 17:29:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:48,857 INFO L225 Difference]: With dead ends: 29 [2019-11-28 17:29:48,857 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 17:29:48,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:29:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 17:29:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-11-28 17:29:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 17:29:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-11-28 17:29:48,866 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-11-28 17:29:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:48,867 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-28 17:29:48,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:29:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-11-28 17:29:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:29:48,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:48,868 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:48,869 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:48,869 INFO L82 PathProgramCache]: Analyzing trace with hash -132605643, now seen corresponding path program 1 times [2019-11-28 17:29:48,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:48,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189383980] [2019-11-28 17:29:48,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:29:49,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189383980] [2019-11-28 17:29:49,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121204807] [2019-11-28 17:29:49,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,126 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:49,135 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:29:49,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:49,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-28 17:29:49,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014138973] [2019-11-28 17:29:49,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:29:49,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:49,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:29:49,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:49,241 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-11-28 17:29:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:49,355 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-28 17:29:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:29:49,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-28 17:29:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:49,358 INFO L225 Difference]: With dead ends: 35 [2019-11-28 17:29:49,358 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 17:29:49,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:29:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 17:29:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-11-28 17:29:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-28 17:29:49,367 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2019-11-28 17:29:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:49,367 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-28 17:29:49,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:29:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-28 17:29:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:29:49,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:49,369 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:49,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:49,576 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash -614490246, now seen corresponding path program 1 times [2019-11-28 17:29:49,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:49,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766752159] [2019-11-28 17:29:49,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:29:49,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766752159] [2019-11-28 17:29:49,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405356821] [2019-11-28 17:29:49,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:49,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:49,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:29:49,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:49,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-28 17:29:49,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329073706] [2019-11-28 17:29:49,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:49,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:49,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:49,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:49,899 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 12 states. [2019-11-28 17:29:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:50,032 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-28 17:29:50,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:29:50,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 17:29:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:50,036 INFO L225 Difference]: With dead ends: 41 [2019-11-28 17:29:50,036 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 17:29:50,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:29:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 17:29:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-11-28 17:29:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 17:29:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-11-28 17:29:50,046 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2019-11-28 17:29:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:50,047 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-28 17:29:50,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-11-28 17:29:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:29:50,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:50,049 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:50,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:50,263 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2127867459, now seen corresponding path program 2 times [2019-11-28 17:29:50,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:50,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029909904] [2019-11-28 17:29:50,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 17:29:50,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029909904] [2019-11-28 17:29:50,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138692526] [2019-11-28 17:29:50,507 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:50,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:50,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:50,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:29:50,561 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 17:29:50,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:50,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2019-11-28 17:29:50,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631821850] [2019-11-28 17:29:50,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 17:29:50,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:50,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 17:29:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:29:50,618 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 13 states. [2019-11-28 17:29:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:50,753 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-11-28 17:29:50,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:29:50,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-11-28 17:29:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:50,755 INFO L225 Difference]: With dead ends: 47 [2019-11-28 17:29:50,755 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 17:29:50,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:29:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 17:29:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-11-28 17:29:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 17:29:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-11-28 17:29:50,763 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 33 [2019-11-28 17:29:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:50,764 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-11-28 17:29:50,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 17:29:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-11-28 17:29:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:29:50,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:50,766 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:50,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:50,970 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1002836670, now seen corresponding path program 2 times [2019-11-28 17:29:50,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:50,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699072498] [2019-11-28 17:29:50,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 17:29:51,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699072498] [2019-11-28 17:29:51,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893706708] [2019-11-28 17:29:51,308 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:51,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:51,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:51,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 17:29:51,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 17:29:51,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:51,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-11-28 17:29:51,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505752418] [2019-11-28 17:29:51,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 17:29:51,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:51,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 17:29:51,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:29:51,406 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 15 states. [2019-11-28 17:29:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:51,523 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-11-28 17:29:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 17:29:51,523 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-11-28 17:29:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:51,526 INFO L225 Difference]: With dead ends: 53 [2019-11-28 17:29:51,526 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 17:29:51,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:29:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 17:29:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-11-28 17:29:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 17:29:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-11-28 17:29:51,537 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 39 [2019-11-28 17:29:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:51,537 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-11-28 17:29:51,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 17:29:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-11-28 17:29:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 17:29:51,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:51,539 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:51,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:51,744 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash 688258629, now seen corresponding path program 3 times [2019-11-28 17:29:51,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:51,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94837196] [2019-11-28 17:29:51,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 17:29:51,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94837196] [2019-11-28 17:29:51,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931766799] [2019-11-28 17:29:51,977 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:52,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 17:29:52,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:52,025 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:29:52,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-28 17:29:52,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:29:52,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 15 [2019-11-28 17:29:52,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132966422] [2019-11-28 17:29:52,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:52,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:52,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:29:52,116 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2019-11-28 17:29:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:52,315 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-28 17:29:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:29:52,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-28 17:29:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:52,317 INFO L225 Difference]: With dead ends: 59 [2019-11-28 17:29:52,317 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:29:52,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:29:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:29:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 17:29:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 17:29:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 17:29:52,324 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 45 [2019-11-28 17:29:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:52,324 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 17:29:52,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 17:29:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:29:52,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:52,326 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:52,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:52,530 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash -77349110, now seen corresponding path program 3 times [2019-11-28 17:29:52,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:52,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267793896] [2019-11-28 17:29:52,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-28 17:29:52,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267793896] [2019-11-28 17:29:52,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094144496] [2019-11-28 17:29:52,793 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:52,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 17:29:52,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:52,838 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 17:29:52,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-28 17:29:52,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:29:52,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 16 [2019-11-28 17:29:52,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694830809] [2019-11-28 17:29:52,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 17:29:52,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 17:29:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:29:52,916 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-11-28 17:29:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:53,146 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-11-28 17:29:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:29:53,148 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-11-28 17:29:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:53,149 INFO L225 Difference]: With dead ends: 35 [2019-11-28 17:29:53,149 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:29:53,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:29:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:29:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:29:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:29:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:29:53,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-11-28 17:29:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:53,151 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:29:53,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 17:29:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:29:53,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:29:53,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:53,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:29:53,389 INFO L242 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2019-11-28 17:29:53,389 INFO L246 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2019-11-28 17:29:53,389 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-28 17:29:53,390 INFO L246 CegarLoopResult]: For program point id2EXIT(lines 12 15) no Hoare annotation was computed. [2019-11-28 17:29:53,390 INFO L249 CegarLoopResult]: At program point id2ENTRY(lines 12 15) the Hoare annotation is: true [2019-11-28 17:29:53,390 INFO L246 CegarLoopResult]: For program point id2FINAL(lines 12 15) no Hoare annotation was computed. [2019-11-28 17:29:53,390 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:29:53,390 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:29:53,390 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:29:53,390 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2019-11-28 17:29:53,390 INFO L246 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2019-11-28 17:29:53,390 INFO L246 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2019-11-28 17:29:53,391 INFO L242 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= 5 ULTIMATE.start_main_~input~0) (<= ULTIMATE.start_main_~input~0 5)) [2019-11-28 17:29:53,391 INFO L246 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-11-28 17:29:53,391 INFO L246 CegarLoopResult]: For program point L17(lines 17 23) no Hoare annotation was computed. [2019-11-28 17:29:53,391 INFO L246 CegarLoopResult]: For program point idFINAL(lines 7 10) no Hoare annotation was computed. [2019-11-28 17:29:53,391 INFO L246 CegarLoopResult]: For program point idEXIT(lines 7 10) no Hoare annotation was computed. [2019-11-28 17:29:53,391 INFO L242 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= |id_#in~x| id_~x) [2019-11-28 17:29:53,391 INFO L246 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2019-11-28 17:29:53,391 INFO L246 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-28 17:29:53,392 INFO L249 CegarLoopResult]: At program point idENTRY(lines 7 10) the Hoare annotation is: true [2019-11-28 17:29:53,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:29:53 BoogieIcfgContainer [2019-11-28 17:29:53,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:29:53,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:29:53,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:29:53,398 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:29:53,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:48" (3/4) ... [2019-11-28 17:29:53,403 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:29:53,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2019-11-28 17:29:53,409 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-11-28 17:29:53,417 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 17:29:53,417 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:29:53,457 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:29:53,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:29:53,460 INFO L168 Benchmark]: Toolchain (without parser) took 6043.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:53,460 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:29:53,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.59 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:53,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.72 ms. Allocated memory is still 1.0 GB. Free memory is still 940.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:29:53,462 INFO L168 Benchmark]: Boogie Preprocessor took 80.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:53,463 INFO L168 Benchmark]: RCFGBuilder took 234.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:53,463 INFO L168 Benchmark]: TraceAbstraction took 5287.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 122.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:53,464 INFO L168 Benchmark]: Witness Printer took 59.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:53,468 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.59 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.72 ms. Allocated memory is still 1.0 GB. Free memory is still 940.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5287.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.5 MB). Peak memory consumption was 122.1 MB. Max. memory is 11.5 GB. * Witness Printer took 59.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 146 SDtfs, 104 SDslu, 919 SDs, 0 SdLazy, 546 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 15 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 44240 SizeOfPredicates, 33 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 282/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...