./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.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 ccd6d122756047ddb1225c106ac06a6748e14c22 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:25:13,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:25:13,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:25:13,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:25:13,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:25:13,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:25:13,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:25:13,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:25:13,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:25:13,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:25:13,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:25:13,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:25:13,186 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:25:13,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:25:13,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:25:13,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:25:13,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:25:13,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:25:13,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:25:13,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:25:13,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:25:13,199 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:25:13,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:25:13,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:25:13,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:25:13,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:25:13,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:25:13,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:25:13,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:25:13,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:25:13,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:25:13,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:25:13,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:25:13,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:25:13,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:25:13,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:25:13,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:25:13,228 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:25:13,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:25:13,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:25:13,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:25:13,230 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:25:13,230 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:25:13,231 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:25:13,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:25:13,232 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:25:13,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:25:13,232 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:25:13,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:25:13,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:25:13,233 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:25:13,233 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:25:13,233 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:25:13,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:25:13,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:25:13,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:25:13,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:25:13,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:25:13,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:25:13,236 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:25:13,236 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:25:13,236 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:25:13,236 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:25:13,236 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:25:13,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:25:13,237 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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-01-11 21:25:13,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:25:13,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:25:13,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:25:13,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:25:13,295 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:25:13,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:13,363 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857ffcea7/672f0ff7b09a43cb94319ac7a7e5a507/FLAG0fbb593d1 [2019-01-11 21:25:13,762 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:25:13,763 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:13,772 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857ffcea7/672f0ff7b09a43cb94319ac7a7e5a507/FLAG0fbb593d1 [2019-01-11 21:25:14,143 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/857ffcea7/672f0ff7b09a43cb94319ac7a7e5a507 [2019-01-11 21:25:14,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:25:14,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:25:14,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:25:14,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:25:14,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:25:14,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14, skipping insertion in model container [2019-01-11 21:25:14,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:25:14,192 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:25:14,388 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:25:14,393 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:25:14,420 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:25:14,437 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:25:14,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14 WrapperNode [2019-01-11 21:25:14,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:25:14,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:25:14,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:25:14,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:25:14,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:25:14,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:25:14,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:25:14,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:25:14,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (1/1) ... [2019-01-11 21:25:14,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:25:14,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:25:14,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:25:14,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:25:14,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (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-01-11 21:25:14,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:25:14,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:25:15,051 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:25:15,052 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 21:25:15,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:15 BoogieIcfgContainer [2019-01-11 21:25:15,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:25:15,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:25:15,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:25:15,057 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:25:15,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:25:14" (1/3) ... [2019-01-11 21:25:15,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a342f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:25:15, skipping insertion in model container [2019-01-11 21:25:15,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:14" (2/3) ... [2019-01-11 21:25:15,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a342f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:25:15, skipping insertion in model container [2019-01-11 21:25:15,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:15" (3/3) ... [2019-01-11 21:25:15,060 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:15,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:25:15,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:25:15,095 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:25:15,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:25:15,125 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:25:15,125 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:25:15,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:25:15,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:25:15,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:25:15,126 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:25:15,126 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:25:15,126 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:25:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-01-11 21:25:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 21:25:15,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,150 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1589939160, now seen corresponding path program 1 times [2019-01-11 21:25:15,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,326 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-01-11 21:25:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,394 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2019-01-11 21:25:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-11 21:25:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,407 INFO L225 Difference]: With dead ends: 64 [2019-01-11 21:25:15,407 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 21:25:15,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 21:25:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-01-11 21:25:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 21:25:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2019-01-11 21:25:15,442 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 13 [2019-01-11 21:25:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,442 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2019-01-11 21:25:15,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2019-01-11 21:25:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 21:25:15,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,444 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1982966170, now seen corresponding path program 1 times [2019-01-11 21:25:15,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,494 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2019-01-11 21:25:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,555 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2019-01-11 21:25:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-11 21:25:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,558 INFO L225 Difference]: With dead ends: 83 [2019-01-11 21:25:15,558 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 21:25:15,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 21:25:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-11 21:25:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 21:25:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2019-01-11 21:25:15,567 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 13 [2019-01-11 21:25:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,568 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 85 transitions. [2019-01-11 21:25:15,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 85 transitions. [2019-01-11 21:25:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:25:15,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,570 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2043259385, now seen corresponding path program 1 times [2019-01-11 21:25:15,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,630 INFO L87 Difference]: Start difference. First operand 48 states and 85 transitions. Second operand 3 states. [2019-01-11 21:25:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,663 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2019-01-11 21:25:15,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:25:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,666 INFO L225 Difference]: With dead ends: 77 [2019-01-11 21:25:15,666 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 21:25:15,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 21:25:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-01-11 21:25:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 21:25:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2019-01-11 21:25:15,674 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 14 [2019-01-11 21:25:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,674 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. [2019-01-11 21:25:15,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2019-01-11 21:25:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:25:15,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,676 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1342194807, now seen corresponding path program 1 times [2019-01-11 21:25:15,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,739 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. [2019-01-11 21:25:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,796 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2019-01-11 21:25:15,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:25:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,798 INFO L225 Difference]: With dead ends: 96 [2019-01-11 21:25:15,798 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 21:25:15,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 21:25:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-01-11 21:25:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 21:25:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2019-01-11 21:25:15,809 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 14 [2019-01-11 21:25:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,809 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2019-01-11 21:25:15,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2019-01-11 21:25:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:25:15,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,811 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1735221817, now seen corresponding path program 1 times [2019-01-11 21:25:15,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,902 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand 3 states. [2019-01-11 21:25:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,002 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2019-01-11 21:25:16,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:25:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,004 INFO L225 Difference]: With dead ends: 160 [2019-01-11 21:25:16,004 INFO L226 Difference]: Without dead ends: 96 [2019-01-11 21:25:16,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-11 21:25:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-01-11 21:25:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-11 21:25:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 158 transitions. [2019-01-11 21:25:16,015 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 158 transitions. Word has length 14 [2019-01-11 21:25:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,016 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 158 transitions. [2019-01-11 21:25:16,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 158 transitions. [2019-01-11 21:25:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:25:16,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,017 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848603, now seen corresponding path program 1 times [2019-01-11 21:25:16,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,055 INFO L87 Difference]: Start difference. First operand 94 states and 158 transitions. Second operand 3 states. [2019-01-11 21:25:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,078 INFO L93 Difference]: Finished difference Result 143 states and 237 transitions. [2019-01-11 21:25:16,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:25:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,080 INFO L225 Difference]: With dead ends: 143 [2019-01-11 21:25:16,080 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 21:25:16,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 21:25:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-01-11 21:25:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 21:25:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 158 transitions. [2019-01-11 21:25:16,102 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 158 transitions. Word has length 15 [2019-01-11 21:25:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,102 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 158 transitions. [2019-01-11 21:25:16,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 158 transitions. [2019-01-11 21:25:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:25:16,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,106 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2042913181, now seen corresponding path program 1 times [2019-01-11 21:25:16,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,202 INFO L87 Difference]: Start difference. First operand 96 states and 158 transitions. Second operand 3 states. [2019-01-11 21:25:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,253 INFO L93 Difference]: Finished difference Result 272 states and 448 transitions. [2019-01-11 21:25:16,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:25:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,255 INFO L225 Difference]: With dead ends: 272 [2019-01-11 21:25:16,256 INFO L226 Difference]: Without dead ends: 182 [2019-01-11 21:25:16,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-11 21:25:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-01-11 21:25:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-11 21:25:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2019-01-11 21:25:16,271 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 15 [2019-01-11 21:25:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,272 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2019-01-11 21:25:16,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2019-01-11 21:25:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:25:16,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,274 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1859027105, now seen corresponding path program 1 times [2019-01-11 21:25:16,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,352 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand 3 states. [2019-01-11 21:25:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,425 INFO L93 Difference]: Finished difference Result 224 states and 364 transitions. [2019-01-11 21:25:16,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:25:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,427 INFO L225 Difference]: With dead ends: 224 [2019-01-11 21:25:16,427 INFO L226 Difference]: Without dead ends: 222 [2019-01-11 21:25:16,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-11 21:25:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2019-01-11 21:25:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-11 21:25:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 286 transitions. [2019-01-11 21:25:16,448 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 286 transitions. Word has length 15 [2019-01-11 21:25:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,451 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 286 transitions. [2019-01-11 21:25:16,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2019-01-11 21:25:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:25:16,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,453 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1093985828, now seen corresponding path program 1 times [2019-01-11 21:25:16,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,532 INFO L87 Difference]: Start difference. First operand 180 states and 286 transitions. Second operand 3 states. [2019-01-11 21:25:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,623 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2019-01-11 21:25:16,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-11 21:25:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,626 INFO L225 Difference]: With dead ends: 324 [2019-01-11 21:25:16,627 INFO L226 Difference]: Without dead ends: 322 [2019-01-11 21:25:16,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-11 21:25:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 256. [2019-01-11 21:25:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-11 21:25:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2019-01-11 21:25:16,644 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 16 [2019-01-11 21:25:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,644 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2019-01-11 21:25:16,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2019-01-11 21:25:16,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:25:16,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,648 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1487012838, now seen corresponding path program 1 times [2019-01-11 21:25:16,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,686 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 3 states. [2019-01-11 21:25:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,740 INFO L93 Difference]: Finished difference Result 596 states and 928 transitions. [2019-01-11 21:25:16,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-11 21:25:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,743 INFO L225 Difference]: With dead ends: 596 [2019-01-11 21:25:16,743 INFO L226 Difference]: Without dead ends: 346 [2019-01-11 21:25:16,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-01-11 21:25:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-01-11 21:25:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-01-11 21:25:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 522 transitions. [2019-01-11 21:25:16,764 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 522 transitions. Word has length 16 [2019-01-11 21:25:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,764 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 522 transitions. [2019-01-11 21:25:16,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 522 transitions. [2019-01-11 21:25:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:25:16,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,768 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,769 INFO L82 PathProgramCache]: Analyzing trace with hash 446393042, now seen corresponding path program 1 times [2019-01-11 21:25:16,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,810 INFO L87 Difference]: Start difference. First operand 344 states and 522 transitions. Second operand 3 states. [2019-01-11 21:25:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,839 INFO L93 Difference]: Finished difference Result 524 states and 792 transitions. [2019-01-11 21:25:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:25:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,847 INFO L225 Difference]: With dead ends: 524 [2019-01-11 21:25:16,847 INFO L226 Difference]: Without dead ends: 358 [2019-01-11 21:25:16,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-11 21:25:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-01-11 21:25:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 21:25:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 530 transitions. [2019-01-11 21:25:16,866 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 530 transitions. Word has length 17 [2019-01-11 21:25:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,866 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 530 transitions. [2019-01-11 21:25:16,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 530 transitions. [2019-01-11 21:25:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:25:16,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,868 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1147457620, now seen corresponding path program 1 times [2019-01-11 21:25:16,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,953 INFO L87 Difference]: Start difference. First operand 356 states and 530 transitions. Second operand 3 states. [2019-01-11 21:25:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,994 INFO L93 Difference]: Finished difference Result 616 states and 924 transitions. [2019-01-11 21:25:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:25:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,999 INFO L225 Difference]: With dead ends: 616 [2019-01-11 21:25:17,000 INFO L226 Difference]: Without dead ends: 614 [2019-01-11 21:25:17,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-01-11 21:25:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 516. [2019-01-11 21:25:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-11 21:25:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2019-01-11 21:25:17,021 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 17 [2019-01-11 21:25:17,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:17,021 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2019-01-11 21:25:17,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2019-01-11 21:25:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:25:17,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:17,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:17,024 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:17,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash 754430610, now seen corresponding path program 1 times [2019-01-11 21:25:17,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:17,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:17,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:17,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:17,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:17,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:17,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:17,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:17,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,095 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand 3 states. [2019-01-11 21:25:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:17,197 INFO L93 Difference]: Finished difference Result 1176 states and 1692 transitions. [2019-01-11 21:25:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:17,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:25:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:17,202 INFO L225 Difference]: With dead ends: 1176 [2019-01-11 21:25:17,203 INFO L226 Difference]: Without dead ends: 678 [2019-01-11 21:25:17,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-01-11 21:25:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2019-01-11 21:25:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-01-11 21:25:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 946 transitions. [2019-01-11 21:25:17,230 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 946 transitions. Word has length 17 [2019-01-11 21:25:17,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:17,232 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 946 transitions. [2019-01-11 21:25:17,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 946 transitions. [2019-01-11 21:25:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:25:17,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:17,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:17,235 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1211663535, now seen corresponding path program 1 times [2019-01-11 21:25:17,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:17,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:17,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:17,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:17,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:17,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:17,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,276 INFO L87 Difference]: Start difference. First operand 676 states and 946 transitions. Second operand 3 states. [2019-01-11 21:25:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:17,359 INFO L93 Difference]: Finished difference Result 1016 states and 1412 transitions. [2019-01-11 21:25:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:17,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:25:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:17,364 INFO L225 Difference]: With dead ends: 1016 [2019-01-11 21:25:17,365 INFO L226 Difference]: Without dead ends: 694 [2019-01-11 21:25:17,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-01-11 21:25:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-01-11 21:25:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-01-11 21:25:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 946 transitions. [2019-01-11 21:25:17,395 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 946 transitions. Word has length 18 [2019-01-11 21:25:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:17,396 INFO L480 AbstractCegarLoop]: Abstraction has 692 states and 946 transitions. [2019-01-11 21:25:17,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 946 transitions. [2019-01-11 21:25:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:25:17,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:17,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:17,399 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1912728113, now seen corresponding path program 1 times [2019-01-11 21:25:17,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:17,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:17,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:17,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:17,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:17,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,473 INFO L87 Difference]: Start difference. First operand 692 states and 946 transitions. Second operand 3 states. [2019-01-11 21:25:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:17,598 INFO L93 Difference]: Finished difference Result 1160 states and 1588 transitions. [2019-01-11 21:25:17,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:17,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:25:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:17,606 INFO L225 Difference]: With dead ends: 1160 [2019-01-11 21:25:17,606 INFO L226 Difference]: Without dead ends: 1158 [2019-01-11 21:25:17,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-01-11 21:25:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1028. [2019-01-11 21:25:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-01-11 21:25:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1362 transitions. [2019-01-11 21:25:17,655 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1362 transitions. Word has length 18 [2019-01-11 21:25:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:17,655 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1362 transitions. [2019-01-11 21:25:17,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1362 transitions. [2019-01-11 21:25:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:25:17,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:17,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:17,658 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1519701103, now seen corresponding path program 1 times [2019-01-11 21:25:17,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:17,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:17,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:17,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:17,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:17,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:17,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:17,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,733 INFO L87 Difference]: Start difference. First operand 1028 states and 1362 transitions. Second operand 3 states. [2019-01-11 21:25:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:17,862 INFO L93 Difference]: Finished difference Result 2312 states and 3028 transitions. [2019-01-11 21:25:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:17,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:25:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:17,869 INFO L225 Difference]: With dead ends: 2312 [2019-01-11 21:25:17,869 INFO L226 Difference]: Without dead ends: 1318 [2019-01-11 21:25:17,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-01-11 21:25:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2019-01-11 21:25:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-01-11 21:25:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1666 transitions. [2019-01-11 21:25:17,925 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1666 transitions. Word has length 18 [2019-01-11 21:25:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:17,925 INFO L480 AbstractCegarLoop]: Abstraction has 1316 states and 1666 transitions. [2019-01-11 21:25:17,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1666 transitions. [2019-01-11 21:25:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:25:17,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:17,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:17,929 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash -834754617, now seen corresponding path program 1 times [2019-01-11 21:25:17,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:17,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:17,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:17,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:17,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:17,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,996 INFO L87 Difference]: Start difference. First operand 1316 states and 1666 transitions. Second operand 3 states. [2019-01-11 21:25:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:18,109 INFO L93 Difference]: Finished difference Result 1976 states and 2484 transitions. [2019-01-11 21:25:18,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:18,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:25:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:18,115 INFO L225 Difference]: With dead ends: 1976 [2019-01-11 21:25:18,115 INFO L226 Difference]: Without dead ends: 1350 [2019-01-11 21:25:18,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-01-11 21:25:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-01-11 21:25:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-01-11 21:25:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1666 transitions. [2019-01-11 21:25:18,169 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1666 transitions. Word has length 19 [2019-01-11 21:25:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:18,169 INFO L480 AbstractCegarLoop]: Abstraction has 1348 states and 1666 transitions. [2019-01-11 21:25:18,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1666 transitions. [2019-01-11 21:25:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:25:18,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:18,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:18,172 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash -133690039, now seen corresponding path program 1 times [2019-01-11 21:25:18,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:18,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:18,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:18,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:18,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:18,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:18,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:18,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:18,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:18,224 INFO L87 Difference]: Start difference. First operand 1348 states and 1666 transitions. Second operand 3 states. [2019-01-11 21:25:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:18,338 INFO L93 Difference]: Finished difference Result 2182 states and 2659 transitions. [2019-01-11 21:25:18,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:18,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:25:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:18,347 INFO L225 Difference]: With dead ends: 2182 [2019-01-11 21:25:18,347 INFO L226 Difference]: Without dead ends: 2180 [2019-01-11 21:25:18,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-01-11 21:25:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2052. [2019-01-11 21:25:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-01-11 21:25:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2466 transitions. [2019-01-11 21:25:18,422 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2466 transitions. Word has length 19 [2019-01-11 21:25:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:18,423 INFO L480 AbstractCegarLoop]: Abstraction has 2052 states and 2466 transitions. [2019-01-11 21:25:18,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2466 transitions. [2019-01-11 21:25:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:25:18,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:18,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:18,427 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:18,428 INFO L82 PathProgramCache]: Analyzing trace with hash -526717049, now seen corresponding path program 1 times [2019-01-11 21:25:18,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:18,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:18,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:18,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:18,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:18,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:18,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:18,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:18,490 INFO L87 Difference]: Start difference. First operand 2052 states and 2466 transitions. Second operand 3 states. [2019-01-11 21:25:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:18,668 INFO L93 Difference]: Finished difference Result 4548 states and 5346 transitions. [2019-01-11 21:25:18,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:18,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:25:18,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:18,670 INFO L225 Difference]: With dead ends: 4548 [2019-01-11 21:25:18,670 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:25:18,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:25:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:25:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:25:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:25:18,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-01-11 21:25:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:18,677 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:25:18,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:25:18,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:25:18,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:25:18,756 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-11 21:25:18,756 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:25:18,757 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:25:18,757 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-01-11 21:25:18,757 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,757 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-01-11 21:25:18,757 INFO L451 ceAbstractionStarter]: At program point L120(lines 4 121) the Hoare annotation is: true [2019-01-11 21:25:18,757 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-11 21:25:18,757 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-11 21:25:18,758 INFO L444 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-01-11 21:25:18,761 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,761 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,761 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,761 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,761 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-11 21:25:18,761 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,761 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,762 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-01-11 21:25:18,762 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-11 21:25:18,762 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-01-11 21:25:18,762 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:25:18,766 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,766 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,766 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,766 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-01-11 21:25:18,766 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,766 INFO L451 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-01-11 21:25:18,766 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-01-11 21:25:18,767 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,767 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-01-11 21:25:18,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:25:18 BoogieIcfgContainer [2019-01-11 21:25:18,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:25:18,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:25:18,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:25:18,782 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:25:18,786 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:15" (3/4) ... [2019-01-11 21:25:18,791 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:25:18,806 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-11 21:25:18,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:25:18,897 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:25:18,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:25:18,902 INFO L168 Benchmark]: Toolchain (without parser) took 4754.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -226.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:18,905 INFO L168 Benchmark]: CDTParser took 0.35 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. [2019-01-11 21:25:18,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:18,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:18,906 INFO L168 Benchmark]: Boogie Preprocessor took 20.84 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:18,907 INFO L168 Benchmark]: RCFGBuilder took 552.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:18,907 INFO L168 Benchmark]: TraceAbstraction took 3727.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:18,907 INFO L168 Benchmark]: Witness Printer took 118.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:18,913 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.35 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 287.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 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 41.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.84 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 552.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3727.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 118.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1109 SDtfs, 543 SDslu, 710 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2052occurred in iteration=18, 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.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...