./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.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 ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:52:34,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:52:34,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:52:34,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:52:34,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:52:34,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:52:34,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:52:34,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:52:34,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:52:34,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:52:34,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:52:34,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:52:34,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:52:34,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:52:34,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:52:34,131 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:52:34,132 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:52:34,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:52:34,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:52:34,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:52:34,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:52:34,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:52:34,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:52:34,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:52:34,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:52:34,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:52:34,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:52:34,148 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:52:34,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:52:34,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:52:34,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:52:34,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:52:34,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:52:34,152 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:52:34,153 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:52:34,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:52:34,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:52:34,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:52:34,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:52:34,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:52:34,173 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:52:34,174 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:52:34,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:52:34,174 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:52:34,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:52:34,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:52:34,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:52:34,176 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:52:34,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:52:34,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:52:34,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:52:34,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:52:34,176 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:52:34,177 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:52:34,177 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:52:34,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:52:34,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:52:34,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:52:34,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:52:34,179 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:52:34,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:52:34,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:52:34,180 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:52:34,180 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:52:34,180 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:52:34,180 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:52:34,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:52:34,180 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 [2018-11-28 18:52:34,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:52:34,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:52:34,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:52:34,249 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:52:34,249 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:52:34,250 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:34,321 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e94f48dc/e2ca046e447b4129bb61139876dea5d4/FLAG76b66a9f9 [2018-11-28 18:52:34,784 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:52:34,785 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:34,791 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e94f48dc/e2ca046e447b4129bb61139876dea5d4/FLAG76b66a9f9 [2018-11-28 18:52:35,134 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e94f48dc/e2ca046e447b4129bb61139876dea5d4 [2018-11-28 18:52:35,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:52:35,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:52:35,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:52:35,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:52:35,145 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:52:35,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8eb2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35, skipping insertion in model container [2018-11-28 18:52:35,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:52:35,176 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:52:35,361 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:52:35,367 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:52:35,388 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:52:35,400 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:52:35,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35 WrapperNode [2018-11-28 18:52:35,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:52:35,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:52:35,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:52:35,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:52:35,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:52:35,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:52:35,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:52:35,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:52:35,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (1/1) ... [2018-11-28 18:52:35,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:52:35,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:52:35,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:52:35,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:52:35,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (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 [2018-11-28 18:52:35,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:52:35,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:52:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-28 18:52:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-28 18:52:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:52:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:52:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:52:35,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:52:35,562 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-28 18:52:35,563 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-28 18:52:35,905 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:52:35,905 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:52:35,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:52:35 BoogieIcfgContainer [2018-11-28 18:52:35,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:52:35,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:52:35,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:52:35,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:52:35,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:52:35" (1/3) ... [2018-11-28 18:52:35,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51740258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:52:35, skipping insertion in model container [2018-11-28 18:52:35,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:52:35" (2/3) ... [2018-11-28 18:52:35,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51740258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:52:35, skipping insertion in model container [2018-11-28 18:52:35,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:52:35" (3/3) ... [2018-11-28 18:52:35,916 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-28 18:52:35,927 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:52:35,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:52:35,955 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:52:35,987 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:52:35,988 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:52:35,988 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:52:35,988 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:52:35,988 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:52:35,988 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:52:35,989 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:52:35,989 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:52:35,989 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:52:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-28 18:52:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:52:36,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:36,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:36,021 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:36,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-11-28 18:52:36,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:36,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:36,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:36,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:52:36,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:36,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:36,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:36,372 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-28 18:52:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:36,444 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-28 18:52:36,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:36,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:52:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:36,457 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:52:36,457 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 18:52:36,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 18:52:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-28 18:52:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 18:52:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-28 18:52:36,510 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-28 18:52:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:36,511 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-28 18:52:36,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-28 18:52:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:52:36,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:36,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:36,514 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:36,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-11-28 18:52:36,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:36,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:36,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:52:36,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:36,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:36,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:36,939 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-28 18:52:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:37,012 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-28 18:52:37,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:37,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-28 18:52:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:37,014 INFO L225 Difference]: With dead ends: 44 [2018-11-28 18:52:37,014 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:52:37,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:52:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:52:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:52:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-28 18:52:37,025 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-28 18:52:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:37,026 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-28 18:52:37,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-28 18:52:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:52:37,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:37,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:37,027 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:37,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-11-28 18:52:37,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:37,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:52:37,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 18:52:37,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:52:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:52:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:52:37,500 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-28 18:52:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:37,598 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-28 18:52:37,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:52:37,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-28 18:52:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:37,602 INFO L225 Difference]: With dead ends: 36 [2018-11-28 18:52:37,602 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 18:52:37,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:52:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 18:52:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-28 18:52:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:52:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-28 18:52:37,609 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-28 18:52:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:37,610 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-28 18:52:37,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:52:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-28 18:52:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:37,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:37,611 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:37,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:37,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-11-28 18:52:37,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:37,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:52:37,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:37,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:37,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:37,846 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-28 18:52:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:37,880 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-28 18:52:37,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:37,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 18:52:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:37,882 INFO L225 Difference]: With dead ends: 48 [2018-11-28 18:52:37,883 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:52:37,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:52:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 18:52:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:37,892 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:37,892 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:37,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:37,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:37,894 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:37,894 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:37,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-11-28 18:52:37,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:37,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:37,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:37,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:52:38,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:38,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:38,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:38,041 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-28 18:52:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:38,078 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-28 18:52:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:38,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-28 18:52:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:38,081 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:52:38,081 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:52:38,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:52:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-28 18:52:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:38,089 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:38,090 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:38,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:52:38,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:38,092 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:38,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:38,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-11-28 18:52:38,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:38,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:38,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:38,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:52:38,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:38,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:52:38,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:38,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:52:38,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:38,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 18:52:38,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:52:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:52:38,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:52:38,935 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-28 18:52:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:39,177 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-28 18:52:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:52:39,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-28 18:52:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:39,180 INFO L225 Difference]: With dead ends: 56 [2018-11-28 18:52:39,180 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 18:52:39,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:52:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 18:52:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-28 18:52:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 18:52:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-28 18:52:39,187 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-28 18:52:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:39,188 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-28 18:52:39,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:52:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-28 18:52:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:52:39,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:39,189 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:39,190 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:39,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:39,190 INFO L82 PathProgramCache]: Analyzing trace with hash 906172561, now seen corresponding path program 1 times [2018-11-28 18:52:39,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:39,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:39,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:52:39,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:52:39,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:52:39,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:52:39,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:52:39,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:39,416 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-28 18:52:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:39,456 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-28 18:52:39,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:52:39,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-28 18:52:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:39,460 INFO L225 Difference]: With dead ends: 54 [2018-11-28 18:52:39,460 INFO L226 Difference]: Without dead ends: 40 [2018-11-28 18:52:39,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:52:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-28 18:52:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-28 18:52:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 18:52:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-28 18:52:39,468 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 34 [2018-11-28 18:52:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:39,469 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-28 18:52:39,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:52:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-28 18:52:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 18:52:39,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:39,470 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:39,471 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:39,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:39,471 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2018-11-28 18:52:39,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:39,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:52:40,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:40,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:52:40,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:40,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:52:40,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:40,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-28 18:52:40,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 18:52:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 18:52:40,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-28 18:52:40,335 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 15 states. [2018-11-28 18:52:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:40,682 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-28 18:52:40,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 18:52:40,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-28 18:52:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:40,689 INFO L225 Difference]: With dead ends: 74 [2018-11-28 18:52:40,689 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 18:52:40,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:52:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 18:52:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-28 18:52:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 18:52:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-28 18:52:40,697 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2018-11-28 18:52:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:40,697 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-28 18:52:40,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 18:52:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-28 18:52:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 18:52:40,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:40,699 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:40,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:40,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash -797786941, now seen corresponding path program 2 times [2018-11-28 18:52:40,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:40,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:40,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:52:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 18:52:41,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:41,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:52:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:52:41,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:52:41,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:52:41,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 18:52:41,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:52:41,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 17 [2018-11-28 18:52:41,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 18:52:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 18:52:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:52:41,465 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 17 states. [2018-11-28 18:52:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:41,672 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-28 18:52:41,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 18:52:41,674 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-28 18:52:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:41,675 INFO L225 Difference]: With dead ends: 78 [2018-11-28 18:52:41,675 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 18:52:41,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:52:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 18:52:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-28 18:52:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 18:52:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-28 18:52:41,684 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 41 [2018-11-28 18:52:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:41,684 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-28 18:52:41,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 18:52:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-28 18:52:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 18:52:41,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:52:41,686 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:52:41,687 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:52:41,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:52:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1496626328, now seen corresponding path program 2 times [2018-11-28 18:52:41,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:52:41,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:52:41,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:41,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:52:41,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:52:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:52:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 18:52:42,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:52:42,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:52:42,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:52:42,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 18:52:42,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:52:42,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:52:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-28 18:52:42,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:52:42,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2018-11-28 18:52:42,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 18:52:42,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 18:52:42,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-11-28 18:52:42,479 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 17 states. [2018-11-28 18:52:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:52:42,675 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-28 18:52:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 18:52:42,677 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-11-28 18:52:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:52:42,677 INFO L225 Difference]: With dead ends: 66 [2018-11-28 18:52:42,678 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:52:42,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:52:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:52:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:52:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:52:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:52:42,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-11-28 18:52:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:52:42,681 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:52:42,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 18:52:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:52:42,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:52:42,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:52:42,725 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:52:42,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:52:42,726 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-28 18:52:42,726 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2018-11-28 18:52:42,726 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-28 18:52:42,726 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-28 18:52:42,726 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-11-28 18:52:42,726 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-11-28 18:52:42,727 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-11-28 18:52:42,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:52:42,727 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:52:42,727 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:52:42,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:52:42,727 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2018-11-28 18:52:42,728 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-28 18:52:42,728 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 21 27) no Hoare annotation was computed. [2018-11-28 18:52:42,728 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-28 18:52:42,728 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-11-28 18:52:42,728 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-28 18:52:42,728 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 21 27) no Hoare annotation was computed. [2018-11-28 18:52:42,728 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-28 18:52:42,729 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-11-28 18:52:42,729 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-11-28 18:52:42,729 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-28 18:52:42,729 INFO L451 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: true [2018-11-28 18:52:42,729 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-28 18:52:42,729 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-28 18:52:42,729 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-11-28 18:52:42,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:52:42 BoogieIcfgContainer [2018-11-28 18:52:42,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:52:42,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:52:42,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:52:42,735 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:52:42,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:52:35" (3/4) ... [2018-11-28 18:52:42,738 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:52:42,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:52:42,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-11-28 18:52:42,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:52:42,745 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-11-28 18:52:42,750 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 18:52:42,750 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 18:52:42,750 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:52:42,808 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:52:42,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:52:42,809 INFO L168 Benchmark]: Toolchain (without parser) took 7670.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:42,811 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:52:42,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.47 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:42,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.90 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:52:42,813 INFO L168 Benchmark]: Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:52:42,813 INFO L168 Benchmark]: RCFGBuilder took 466.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:42,814 INFO L168 Benchmark]: TraceAbstraction took 6826.99 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.6 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:52:42,815 INFO L168 Benchmark]: Witness Printer took 73.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:52:42,818 INFO L336 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 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.47 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 935.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.90 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.07 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 466.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6826.99 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.6 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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 5 procedures, 28 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 301 SDtfs, 36 SDslu, 2102 SDs, 0 SdLazy, 531 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 9 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 441 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 43099 SizeOfPredicates, 13 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 121/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...